Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Arithmetic Circuits

Showing: 21 courses
NPTEL

Digital Circuits and Systems

9 rewiews
Comprehensive exploration of digital circuits, from basic logic to advanced systems. Covers combinational and sequential circuits, arithmetic operations, state machines, and programmable logic devices.
Add to list
40 Lesons
1 day 11 hours
On-Demand
Free-Video
NPTEL

Digital Electronic Circuits

1 rewiews
Digital systems represent and manipulate digital signals. Such signals represent only finite number of discreet values. A signal can be discreet by nature whereas, a continuous signal can be discretized for digital processing and then converted back.
Add to list
61 Lesons
1 day 7 hours
On-Demand
Free-Video
NPTEL

Digital Circuits

0 rewiews
Comprehensive exploration of digital circuits, covering number systems, Boolean algebra, logic gates, arithmetic circuits, sequential circuits, finite state machines, data converters, memory, FPGA, VHDL, and microprocessors.
Add to list
66 Lesons
1 day 7 hours
On-Demand
Free-Video
Simons Institute

Tractable Bounding of Counterfactual Queries by Knowledge Compilation

0 rewiews
Explores bounding partially identifiable queries in causal models using knowledge compilation, offering computational advantages for inference in Bayesian networks with shared structures.
Add to list
1 Lesons
34 minutes
On-Demand
Free-Video
Centre de recherches mathématiques - CRM

Tensor Decomposition Algorithms via Algebraic Complexity

0 rewiews
Explorez les algorithmes de décomposition tensorielle et leur lien avec les circuits arithmétiques, en examinant les cas moyens et les pires scénarios pour les tenseurs de faible rang.
Add to list
1 Lesons
52 minutes
On-Demand
Free-Video
Centre for Networked Intelligence, IISc

Applications of Algebraic Complexity to Unsupervised Learning

0 rewiews
Delve into advanced algebraic complexity theory and its applications in unsupervised learning algorithms, exploring computational hardness of multivariate polynomials and efficient learning techniques.
Add to list
1 Lesons
1 hour 22 minutes
On-Demand
Free-Video
Simons Institute

Tractable Learning in Structured Probability Spaces

0 rewiews
Explore tractable learning in structured probability spaces, focusing on logical circuits, probabilistic inference, and learning algorithms for complex datasets with constraints.
Add to list
30 Lesons
40 minutes
On-Demand
Free-Video
TheIACR

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application

0 rewiews
Explore efficient zero-knowledge arguments for arithmetic circuits, their applications, and novel approaches to MPC-in-the-head protocols, with a focus on improving performance and reducing communication costs.
Add to list
14 Lesons
28 minutes
On-Demand
Free-Video
TheIACR

Boosting Verifiable Computation on Encrypted Data

0 rewiews
Explore verifiable computation on encrypted data, covering homomorphic encryption, SNARKs, and polynomial commitments for secure and private delegation of computation.
Add to list
16 Lesons
21 minutes
On-Demand
Free-Video
Simons Institute

Homomorphic Encryption in the SPDZ Protocol for MPC

0 rewiews
Explore homomorphic encryption in SPDZ protocol for secure multi-party computation, covering threshold encryption, distributed decryption, and zero-knowledge proofs for improved security and efficiency.
Add to list
23 Lesons
54 minutes
On-Demand
Free-Video
Simons Institute

New Ways to Garble Arithmetic Circuits

0 rewiews
Explores innovative techniques for garbling arithmetic circuits, improving efficiency, modularity, and functionality. Presents constant-rate schemes for large integers and modular computation, with enhanced capabilities for mixed arithmetic-Boolean opera…
Add to list
1 Lesons
51 minutes
On-Demand
Free-Video
Paul G. Allen School

ITC Conference - Line Point Zero Knowledge and Its Applications

0 rewiews
Explore line-point zero knowledge proofs, their efficiency in arithmetic circuit satisfiability, and applications in non-interactive secure computation and vector oblivious linear evaluation.
Add to list
13 Lesons
24 minutes
On-Demand
Free-Video
Simons Institute

Lower Bounds for Tractable Arithmetic Circuits

0 rewiews
Explores techniques for proving size lower bounds on tractable arithmetic circuits, focusing on structural restrictions and their impact on circuit complexity in probabilistic reasoning.
Add to list
1 Lesons
43 minutes
On-Demand
Free-Video
ACM SIGPLAN

Automated Detection of Under-Constrained Circuits in Zero-Knowledge Proofs

0 rewiews
Discover a novel technique for detecting vulnerabilities in zero-knowledge proof circuits, combining SMT solving with uniqueness inference to enhance security in blockchain applications.
Add to list
1 Lesons
19 minutes
On-Demand
Free-Video
IEEE

Wolverine - Fast, Scalable, and Communication-Efficient Zero-Knowledge Proofs for Boolean and Arithmetic Circuits

0 rewiews
Explore fast, scalable zero-knowledge proofs for Boolean and arithmetic circuits, covering applications, existing systems, tradeoffs, and innovative protocols like SVLE and Cotton Bucketing.
Add to list
14 Lesons
15 minutes
On-Demand
Free-Video
TheIACR

On the Untapped Potential of Encoding Predicates by Arithmetic Circuits and Their Applications

0 rewiews
Explores innovative encoding techniques for predicates using arithmetic circuits, discussing their potential applications and implications for cryptographic systems.
Add to list
22 Lesons
22 minutes
On-Demand
Free-Video
TheIACR

Sub Linear Lattice Based Zero Knowledge Arguments for Arithmetic Circuits

0 rewiews
Explore cutting-edge cryptographic techniques for zero-knowledge proofs in arithmetic circuits, focusing on sub-linear lattice-based approaches presented at Crypto 2018.
Add to list
1 Lesons
20 minutes
On-Demand
Free-Video
NPTEL-NOC IITM

Ripple Carry Adder: Design, Delay, and Area Analysis

0 rewiews
Learn about ripple carry adders, including their design, delay analysis, and area considerations in digital circuit implementation.
Add to list
1 Lesons
13 minutes
On-Demand
Free-Video
NPTEL-NOC IITM

Fast Adder: Carry Select Adder

0 rewiews
Explore the carry select adder, a fast addition technique, and understand its principles and implementation in digital circuit design.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video
LF Decentralized Trust

Zero Knowledge Proofs and ZK Programming in Blockchain Application Development

0 rewiews
Explore zero knowledge proofs and implement a zkRollup system in Circom. Learn SNARK technology, Circom programming, and integrate with Hyperledger Besu or Fabric for blockchain applications.
Add to list
1 Lesons
3 hours
On-Demand
Free-Video
Probabilistic AI School

Probabilistic Circuits

0 rewiews
Explore probabilistic circuits with Antonio Vergari, covering foundational concepts and advanced applications in AI and machine learning.
Add to list
1 Lesons
2 hours 36 minutes
On-Demand
Free-Video