The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Time-Space Trade-Offs in a Pebble Game
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
Space-Time Tradeoffs for Oblivious Interger Multiplications
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P
ACM SIGACT News
Time-Space trade-offs for some algebraic problems
Journal of the ACM (JACM)
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Asymptotically tight bounds on time-space trade-offs in a pebble game
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Any Boolean straight-line program which computes the transitive closure of an nxn Boolean matrix by successive squaring requires time exceeding any polynomial in n if the space used is o(n). This is the first demonstration of a “natural” algorithm which (1) has a polynomial time implementation and (2) has a small (e.g., O(log2n)) space implementation, but (3) has no implementation running in polynomial time and small space simultaneously. It is also shown that any implementation of Warshall's transitive closure algorithm requires &Ohgr;(n) space.