A general sequential time-space tradeoff for finding unique elements
SIAM Journal on Computing
On lower bounds for read-k-times branching programs
Computational Complexity
On separating the read-k-times branching program hierarchy
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Determinism versus non-determinism for linear time RAMs (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Time-Space Tradeoffs for Branching Programs
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On the nonapproximability of boolean Function by OBDDs and read-k-times Branching Programs
Information and Computation
Time-space trade-off lower bounds for randomized computation of decision problems
Journal of the ACM (JACM)
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Randomness versus Nondeterminism for Read-Once and Read- k Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Separating Oblivious and Non-oblivious BPs
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Information Processing Letters
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On uncertainty versus size in branching programs
Theoretical Computer Science
Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
BDDs: design, analysis, complexity, and applications
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
On multi-partition communication complexity
Information and Computation
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Time-space lower bounds for satisfiability
Journal of the ACM (JACM)
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Theoretical Computer Science - Mathematical foundations of computer science 2000
Theoretical Computer Science
A note on the decoding complexity of error-correcting codes
Information Processing Letters
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
Comparison-based time-space lower bounds for selection
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
BDDs-design, analysis, complexity, and applications
Discrete Applied Mathematics
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
On multi-partition communication complexity
Information and Computation
Comparison-based time-space lower bounds for selection
ACM Transactions on Algorithms (TALG)
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
We prove that for all positive integer k and for all sufficiently small \math if n is sufficiently large then there is no Boolean (or 2-way) branching program of size less than \math which for all inputs \math computes in time kn the parity of the number of elements of the set of all pairs x,y with the property \math. For the proof of this fact we show that if \mathn is a random n by n matrix over the field with 2 elements with the condition that "\math, \math implies \math" then with a high probability the rank of each \math by \math submatrix of A is at least \math, where \math is an absolute constant and n is sufficiently large with respect to \math.