A nondeterministic space-time tradeoff for linear codes

Authors:
S. Jukna
Affiliations:
Institute of Mathematics and Informatics, Akademijos 4, LT-80663 Vilnius, Lithuania
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 0

On lower bounds for read-k-times branching programs

Computational Complexity
Neither reading few bits twice nor reading illegally helps much

Discrete Applied Mathematics
Time-space tradeoffs for branching programs

Journal of Computer and System Sciences
Time-space trade-off lower bounds for randomized computation of decision problems

Journal of the ACM (JACM)
Determinism versus nondeterminism for linear time RAMs with memory restrictions

Journal of Computer and System Sciences - STOC 1999
Lower Bounds for Deterministic and Nondeterministic Branching Programs

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

We are interested in proving exponential lower bounds on the size of nondeterministic D-way branching programs computing functions f:D^n-{0,1} in linear time, that is, in time at most kn for a constant k. Ajtai has proved such lower bounds for explicit functions over domains D of size about n, and Beame, Saks and Thathachar for functions over domains of size about 2^2^^^k. We prove an exponential lower bound 2^@W^(^n^/^c^^^k^) for an explicit function over substantially smaller domain D of size about 2^k. Our function is a universal function of linear codes.