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… (More)
Wikipedia

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.
Highly Cited
2014
Highly Cited
2014
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits
We construct the first (key-policy) attribute-based encryption (ABE) system with short secret keys: the size of keys in our… (More)
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Arithmetic Circuits: A Chasm at Depth Three
We show that, over Q, if an n-variate polynomial of degree d = n<sup>O(1)</sup> is computable by an arithmetic circuit of size s… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Arithmetic circuits: the chasm at depth four gets wider
In their paper on the “chasm at depth four”, Agrawal and Vinay have shown that polynomials in m variables of degree O(m) which… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
All previously known fully homomorphic encryption (FHE) schemes use Gentry's blueprint:* SWHE: Construct a somewhat homomorphic… (More)
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Variable Latency Speculative Addition: A New Paradigm for Arithmetic Circuit Design
Adders are one of the key components in arithmetic circuits. Enhancing their performance can significantly improve the quality of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Arithmetic Circuits: A Chasm at Depth Four
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
An Exponential Lower Bound for Depth 3 Arithmetic Circuits
We prove the first exponential lower bound on the size of any depth 3 arithmetic circuit with unbounded fanin computing an… (More)
Is this relevant?
1994
1994
Some results on uniform arithmetic circuit complexity
We introduce a natural set of arithmetic expressions and define the complexity class AE to consist of all those arithmetic… (More)
Is this relevant?
1992
1992
Arithmetic Circuit Complexity and Motion Planning Arithmetic Circuit Complexity and Motion Planning
This dissertation presents the results of my research in two areas: parallel algorithms/circuit complexity, and algorithmic… (More)
Is this relevant?
1991
1991
Arithmetic Circuit Complexity and Motion Planning
This dissertation presents the results of my research in two areas: parallel algorithms/circuit complexity, and algorithmic… (More)
  • figure 2.1
  • figure 4.1
  • figure 4.2
  • figure 4.3
  • figure 4.4
Is this relevant?