|
3
|
Algorithms for Discrete Fourier Transform and Convolution
– Lu
- 1997
|
|
19
|
One Complexity Theorist's View of Quantum Computing
– Lance Fortnow
- 2000
|
|
43
|
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits, in
– V Vinay
- 1991
|
|
9
|
B.: A Very Hard Log Space Counting Class
– C Àlvarez, Jenner
- 1990
|
|
7
|
Structural Complexity I. Texts in Theoretical Computer Science. An EATCS Series
– J L Balcazar, J Daz, J Gabarro
- 1995
|
|
40
|
Finite monoids and the fine structure of NC
– D A Mix Barrington, D Th'erien
- 1988
|
|
55
|
Complete problems for deterministic polynomial time
– N Jones, W Laaser
- 1977
|
|
55
|
The Boolean formula value problem is in ALOGTIME
– Samuel R. Buss
- 1987
|
|
5
|
Structure and importance of logspace MOD-classes
– G Buntrock, C Damm, U Hertrampf, C Meinel
- 1992
|
|
43
|
On the unique satisfiability problem
– A Blass, Y Gurevich
- 1982
|
|
36
|
An Optimal Parallel Algorithm for Formula Evaluation
– S. Buss, S. Cook, A. Gupta, V. Ramachandran
- 1992
|
|
409
|
The complexity of computing the permanent
– L G Valiant
- 1979
|
|
78
|
The complexity of facets (and some facets of complexity
– C H Papadimitriou, M Yannakakis
- 1984
|
|
1
|
The complexity of tensor circuit evaluation
– M Beaudry, M Holzer
- 2001
|
|
27
|
On the power of polynomial time bit-reductions
– U Hertrampf, C Lautemann, T Schwentick, H Vollmer, K W Wagner
- 1993
|
|
53
|
The circuit value problem is log space complete for
– R E Ladner
- 1975
|
|
34
|
Finite Monoids and the Fine Structure of NC 1
– D A Barrington, D Therien
- 1988
|
|
25
|
The Complexity of Boolean Functions. Wiley-Teubner
– I Wegener
- 1987
|
|
14
|
Realizable universal quantum logic gates
– T Sleator, H Weinfurter
- 1995
|
