by Avi Wigderson
ftp://ftp.informatik.uni-trier.de/pub/Users-CTVD/eccc/reports/1995/TR95-049/Paper.ps
Add To MetaCart
Abstract:
Boolean complexity classes vs. their arithmetic analogs
Citations
|
239
|
Algebraic methods in the theory of lower bounds for boolean circuit complexity. 19th STOC
– Smolensky
- 1987
|
|
195
|
A taxonomy of problems with fast parallel algorithms
– Cook
- 1985
|
|
172
|
NP is as easy as detecting unique solutions
– Valiant, Vazirani
- 1986
|
|
119
|
Matching is as easy as matrix inversion
– Mulmuley, Vazirani, et al.
- 1987
|
|
108
|
On span programs
– Karchmer, Wigderson
- 1993
|
|
70
|
Lower bounds for the size of circuits of bounded depth with basis
– Razborov
- 1987
|
|
69
|
On relating time and space to size and depth
– Borodin
- 1977
|
|
65
|
On the tape complexity of deterministic context-free languages
– Sudborough
- 1978
|
|
58
|
Tree-size bounded alternation
– Ruzzo
- 1980
|
|
57
|
A complexity theory based on Boolean algebra
– Skyum, Valiant
- 1985
|
|
55
|
Properties that Characterize LOGCFL
– Venkateswaran
- 1991
|
|
52
|
Two Applications of Inductive Counting for Complementation Problems
– Borodin, Cook, et al.
- 1989
|
|
35
|
Structure and importance of the logspace-mod class
– Buntrock, Damm, et al.
- 1992
|
|
30
|
Upper and Lower Bounds for First Order Expressibility
– Immerman
- 1982
|
|
15
|
Depth reduction for noncommutative arithmetic circuits
– Allender, Jiao
- 1993
|
|
13
|
NL=poly ` \PhiL=poly
– Wigderson
- 1994
|
|
8
|
Semi-unbounded fan-in circuits: Boolean vs. arithmetic
– G'al
- 1995
|
|
3
|
Boolean circuits versus arithmetic circuits
– Gathen, Seroussi
- 1991
|
