On Separators, Segregators and Time versus Space

by Rahul Santhanam , To Paul
Citations:6 - 0 self

Documents Related by Co-Citation

39 On determinism versus nondeterminism and related problems – W Paul, N Pippenger, E Szemeredi, W Trotter - 1983
92 A separator theorem for graphs with an excluded minor and its applications – Noga Alon, Paul Seymour, Robin Thomas - 1990
2 ENDRE SZEMERÉDI, AND AVI WIGDERSON: Constructing small sets that are uniform in arithmetic progressions – ALEXANDER RAZBOROV - 1993
20 Dimension expanders – Alexander Lubotzky, Efim Zelmanov, In Memory Of Walter Feit
317 Non-Sunada Graphs – Robert Brooks, In Memory Of Hubert Pesce, M Quotients Of M - 1998
397 A Separator Theorem for Planar Graphs f – Richard J. Lipton, Robert E. Tarjan - 1977
2 Computational Complexity: A Modern Approach Chapter 11 and 22 – S Arora, B Barak - 2009
43 Sparse quasi-random graphs – Fan Chung, Ronald Graham - 1989
92 On ACC and threshold circuits – A Yao - 1990
122 Intersection theorems with geometric consequences, Combinatorica 1 – P Frankl, R M Wilson - 1981
98 Approximating the cut-norm via Grothendieck’s inequality – Noga Alon, Assaf Naor - 2004
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
286 Algebraic methods in the theory of lower bounds for Boolean circuit complexity – R Smolensky - 1987
50 bounds on the size of bounded depth networks over a complete basis with logical addition – A Razborov, Lower - 1987
18 Boolean Function Complexity: Advances and Frontiers. Algorithms and Combinatorics – Stasys Jukna - 2012
173 Natural Proofs – Alexander A. Razborov, Steven Rudich - 1994
176 The complexity of finite functions – R B Boppana, M Sipser - 1990
151 Computational Complexity - A Modern Approach – Sanjeev Arora, Boaz Barak - 2009