|
33
|
Trotter: On determinism versus non-determinism and related problems
– W J Paul, N Pippenger, E Szemerédi, W T
- 1983
|
|
80
|
A separator theorem for graphs with an excluded minor and its applications
– Noga Alon, Paul Seymour, Robin Thomas
- 1990
|
|
1
|
Computational Complexity: A modern approach. Chapter on Communication Complexity
– S Arora, B Barak
|
|
85
|
On ACC and threshold circuits
– AC Yao
- 1990
|
|
111
|
Intersection theorems with geometric consequences
– P Frankl, R M Wilson
- 1981
|
|
29
|
Sparse quasi-random graphs
– Fan Chung, Ronald Graham
- 1989
|
|
72
|
Approximating the cut-norm via Grothendieck’s inequality
– Noga Alon, Assaf Naor
- 2004
|
|
5
|
Boolean Function Complexity: Advances and Frontiers
– S Jukna
- 2012
|
|
1
|
Towards separating nondeterminisn from determinisn
– R Kannan
- 1984
|
|
1
|
On determinism versus non-determinisn and related problems. FOCS
– W Paul, N Pippenger, E Szemeredi, W Trotter
- 1983
|
|
168
|
The complexity of finite functions
– R B Boppana, M Sipser
- 1992
|
|
46
|
bounds on the size of bounded depth networks over a complete basis with logical addition, Matematicheskie Zametki 41
– A A Razborov, Lower
- 1987
|
|
152
|
Natural Proofs
– Alexander A. Razborov, Steven Rudich
- 1994
|
|
262
|
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
– Roman Smolensky
- 1987
|
|
72
|
Computational complexity: A modern approach
– Sanjeev Arora, Boaz Barak
- 2009
|
|
45
|
On time versus space
– John Hopcroft, Wolfgang Paul, Leslie Valiant
- 1977
|
|
8
|
Limitations on explicit constructions of expanding graphs
– M KLAWE
- 1984
|
|
4
|
On the spectral gap for finitely-generated subgroups of SU(2
– J Bourgain, A Gamburd
- 2007
|
|
1
|
Private communication. [BK79] [Bou09] Frank Bernhart and Paul C. Kainen. The book thickness of a graph
– B Barak, R Impagliazzo, A Shpilka, A Wigderson
- 2004
|
