Skip to search formSkip to main contentSkip to account menu

Arithmetic circuit complexity

Known as: Arithmetic circuit, Arithmetic circuits complexity 
In computational complexity theory, arithmetic circuits are the standard model for computing polynomials. Informally, an arithmetic circuit takes as… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations

Broader (1)

Circuit complexity
Computational complexity theoryGeometric complexity theoryMultilinear polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A Flexible Solver for Finite Arithmetic Circuits
Arithmetic circuits arise in the context of weighted logic programming languages, such as Datalog with aggregation, or Dyna. A… 
2008
2008
Arithmetic Circuit Optimization in Finite Word Length Approximation of Arbitrary Functions
In digital circuit design using a hardware description language, some elementary functions and user defined functions can not be… 
2007
2007
FPGA Implementation of Low Power Parallel Multiplier
In the fast growing communication field, requirements of low power designs are increasing to reduce the power losses and decrease… 
Review
2005
Review
2005
Zero-Knowledge Proofs for Mix-nets of Secret Shares and a Version of ElGamal with Modular Homomorphism
Mix-nets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving… 
Review
2003
Review
2003
State of the art in CMOS threshold logic VLSI gate implementations and systems
In recent years, there has been renewed interest in Threshold Logic (TL), mainly as a result of the development of a number of… 
1996
1996
Verification of Arithmetic Circuits by Comparing Two Similar Circuits
Recently there have been a lot of progress in technologies for comparing two structurally similar large circuits [2, 14, 13… 
1992
1992
Arithmetic Circuit Complexity \& Motion Planning
This dissertation presents the results of my research in two areas: parallel algorithms/circuit complexity, and algorithmic… 
1992
1992
VLSI arithmetic with current mode multiple valued logic
A general design methodology for arithmetic operators in current mode multiple value logic is described. It is based on the… 
1985
1985
The parallel complexity of exponentiating polynomials over finite fields
Modular integer exponentiation (given a, e, and m. compute a’ mod m) is a fundamental problem in algebraic complexity for which… 
1980
1980
High Density Integrated Computing Circuitry with Multiple Valued Logic
It is well known that multiple valued logic can theoretically provide a greater logical packing density than binary logic. In… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)