|
5
|
A Turing machine hierarchy
– S Zak
- 1983
|
|
7
|
Time-space tradeoffs for SAT on nonuniform machines
– I Tourlakis
|
|
37
|
A note on succinct representations of graphs
– C H Papadimitriou, M Yannakakis
- 1986
|
|
19
|
Superlinear Lower Bounds For Bounded-Width Branching Programs
– David A. Mix Barrington, Howard Straubing
- 1995
|
|
13
|
The Power of the Middle Bit of a #P Function
– Frederic Green , Johannes Köbler, Kenneth W. Regan, Thomas Schwentick, Jacobo Torán
- 1995
|
|
24
|
How to multiply matrices faster
– V Y Pan
- 1984
|
|
4
|
Solving systems of non-linear equations faster
– J F Canny, E Kaltofen, L Yagati
- 1989
|
|
8
|
Exponential size lower bounds for some depth three circuits
– P Y Yan, I Parberry
- 1994
|
|
4
|
A note on a theorem of
– H Caussinus
- 1996
|
|
10
|
On Time versus Space II
– W J Paul, R Reischuk
- 1981
|
|
2
|
A lower bound for depth-3 circuits with MOD m gates
– V Grolmusz
- 1998
|
|
6
|
Worst-case upper bounds
– Evgeny Dantsin, Edward Hirsch
|
|
4
|
In search of an easy witness: exponential time versus probabilistic polynomial time
– R Impagliazzo, V Kabanets, A Wigderson
|
|
1
|
Linear systems over composite moduli
– Arkadev Chattopadhyay, Avi Wigderson
|
|
2
|
Nearly linear time. Logic at Botik ’89, Springer-Verlag LNCS 363
– Y Gurevich, S Shelah
- 1989
|
|
1
|
Galactic Algorithms
– R J Lipton
- 2010
|
|
31
|
On the method of approximations
– A A Razborov
- 1989
|
|
19
|
A circuitbased proof of toda’s theorem
– Ravi Kannan, H Venkateswaran, V Vinay, Andrew Chi-Chih Yao
- 1993
|
|
46
|
bounds on the size of bounded depth networks over a complete basis with logical addition, Matematicheskie Zametki 41
– A A Razborov, Lower
- 1987
|
