AbstractLet EH be the hypothesis that a certain type of expander graph has an explicit construction. Let io-SPACE(T(n)) be the class of problems solvable by algorithms that for infinitely many inputs use at most space T(n). Then the following holds: There exists ϵ > 0 such that for any polynomial time bound T(n)=nk, EH→ (P=R or TIME(T(n))⊆sio-SPACE(T1−ε(n)))
AbstractWe give the first nontrivial model-independent time–space tradeoffs for satisfiability. Name...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
For various random constraint satisfaction problems there is a significant gap between the largest c...
AbstractWe study the problem of testing the expansion of graphs with bounded degree d in sublinear t...
We explore the relationships between the computational problem of recognizing expander graphs, and t...
Parallel time and space are perhaps the two most fundamental resources in computation. They appear t...
We study the problem of testing the expansion of graphs with bounded degree d in sublinear time. A g...
We study the space complexity of refuting unsatisfiable random k-CNFs in the Resolution proof system...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
During the last decade, an active line of research in proof complexity has been into the space compl...
Algebraic proof systems, such as Polynomial Calculus (PC) and Polynomial Calculus with Resolution (P...
During the last decade, an active line of research in proof complexity has been into the space compl...
Finding k-clique in a graph can trivially be done in time n^{O(k)}, and this is more or less tight i...
AbstractA new lower bound on the computational complexity of the theory of real addition and several...
AbstractWe give the first nontrivial model-independent time–space tradeoffs for satisfiability. Name...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
For various random constraint satisfaction problems there is a significant gap between the largest c...
AbstractWe study the problem of testing the expansion of graphs with bounded degree d in sublinear t...
We explore the relationships between the computational problem of recognizing expander graphs, and t...
Parallel time and space are perhaps the two most fundamental resources in computation. They appear t...
We study the problem of testing the expansion of graphs with bounded degree d in sublinear time. A g...
We study the space complexity of refuting unsatisfiable random k-CNFs in the Resolution proof system...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if G = (V...
During the last decade, an active line of research in proof complexity has been into the space compl...
Algebraic proof systems, such as Polynomial Calculus (PC) and Polynomial Calculus with Resolution (P...
During the last decade, an active line of research in proof complexity has been into the space compl...
Finding k-clique in a graph can trivially be done in time n^{O(k)}, and this is more or less tight i...
AbstractA new lower bound on the computational complexity of the theory of real addition and several...
AbstractWe give the first nontrivial model-independent time–space tradeoffs for satisfiability. Name...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
For various random constraint satisfaction problems there is a significant gap between the largest c...
DOI
Add to ORKG