Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Characterizations of flowchartable recursions short version
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Path systems and language recognition
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Formal languages and their relation to automata
Formal languages and their relation to automata
Record of the Project MAC conference on concurrent systems and parallel computation
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Maze recognizing automata and nondeterministic tape complexity
Journal of Computer and System Sciences
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
Typechecking Top-Down Uniform Unranked Tree Transducers
ICDT '03 Proceedings of the 9th International Conference on Database Theory
On the Space and Access Complexity of Computation DAGs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
On Scheduling Complex Dags for Internet-Based Computing
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Frontiers of tractability for typechecking simple XML transformations
Journal of Computer and System Sciences
On the minimization of XML Schemas and tree automata for unranked trees
Journal of Computer and System Sciences
Typechecking top-down XML transformations: Fixed input or output schemas
Information and Computation
Two dynamic programming algorithms for which interpreted pebbling helps
Information and Computation
A characterization of the power of vector machines
Journal of Computer and System Sciences
Storage requirements for deterministic polynomialtime recognizable languages
Journal of Computer and System Sciences
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
The size and depth of layered Boolean circuits
Information Processing Letters
Upper and lower I/O bounds for pebbling r-pyramids
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
Incremental branching programs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
The size and depth of layered boolean circuits
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Batch-Scheduling dags for internet-based computing
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
A pebble game for internet-based computing
Theoretical Computer Science
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Upper and lower I/O bounds for pebbling r-pyramids
Journal of Discrete Algorithms
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
There are two main results proved here. The first states that a certain set SP of strings (those coding ''solvable path systems'') has tape complexity (log n)^2 iff every set in (i.e., of deterministic polynomial time complexity) has tape complexity (log n)^2. The second result gives evidence that SP does not have tape complexity (log n)^k for any k.