Time-space tradeoffs for branching programs

Journal of Computer and System Sciences

Volumn 63, Issue 4, 2001, Pages 542-572

  Beame, Paul ^a   Jayram, T S ^b   Saks, Michael ^c  

^a University of Washington   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DECISION THEORY; SEMANTICS;

BRANCHING PROGRAMS; LOWER BOUNDS; TIME SPACE TRADEOFFS;

TIME SHARING PROGRAMS;

EID: 0035733585     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.2001.1778     Document Type: Article

References (31)

1. A time-space tradeoff for Boolean matrix multiplication
2. Time-space tradeoffs for algebraic problems on general sequential models
3. Determinism versus non-determinism for linear time RAMs with memory restrictions
4. Determinism versus non-determinism for linear time RAMs with memory restrictions
5. A non-linear time lower bound for boolean branching programs
6. Meanders and their applications in lower bounds arguments
7. A time-space tradeoff for sorting on a general sequential model of computation
8. Symbolic model checking for sequential circuit verification
9. A general time-space tradeoff for finding unique elements
10. Linear algebra methods in combinatorics with applications to geometry and computer science (Preliminary Version 2)
11. A time-space tradeoff for element distinctness
12. A lower bound of read-once-only branching programs
13. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
14. On lower bounds for read-k times branching programs
15. Graph-based algorithms for boolean function manipulation
16. Super-linear time-space tradeoff lower bounds for randomized computation
17. Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability
18. Time-space tradeoffs for nondeterministic computation
19. A simple function that requires exponential size read once branching programs
20. Inequalities
21. Monotone circuits for connectivity require super-logarithmic depth
22. Time-space tradeoffs for sat
23. The computational complexity of universal hashing
24. On simultaneous resource bounds
25. Lower bounds for deterministic and nondeterministic branching programs
26. A new lower bound theorem for read only once branching programs and its applications
27. On separating the read-k times branching program hierarchy
28. Time-space trade-offs for branching programs
29. On the complexity of branching programs and decision trees for clique functions
30. Near-optimal time-space tradeoff for element distinctness