Bandwidth constraints on problems complete for polynomial time
- 30 September 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 26 (1-2) , 25-52
- https://doi.org/10.1016/0304-3975(83)90078-6
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- AlternationJournal of the ACM, 1981
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Space bounds for processing contentless inputsJournal of Computer and System Sciences, 1975
- On tape-bounded complexity classes and multihead finite automataJournal of Computer and System Sciences, 1975
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Some Results on Tape-Bounded Turing MachinesJournal of the ACM, 1969
- An algorithm for reducing the bandwidth of a matrix of symmetrical configurationThe Computer Journal, 1965