# Arithmetic circuit complexity

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2014

Highly Cited

2014

- IACR Cryptology ePrint Archive
- 2014

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

- IEEE 54th Annual Symposium on Foundations of…
- 2013

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

- Theor. Comput. Sci.
- 2012

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

- IEEE 52nd Annual Symposium on Foundations of…
- 2011

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

- Design, Automation and Test in Europe
- 2008

Adders are one of the key components in arithmetic circuits. Enhancing their performance can significantly improve the quality of… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- 49th Annual IEEE Symposium on Foundations of…
- 1998

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

- STOC
- 1998

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

- Mathematical systems theory
- 1994

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

- 1992

This dissertation presents the results of my research in two areas: parallel algorithms/circuit complexity, and algorithmic… (More)

Is this relevant?

1991

1991

- 1991

This dissertation presents the results of my research in two areas: parallel algorithms/circuit complexity, and algorithmic… (More)

Is this relevant?