Simultaneous (poly-time, log-space) lower bounds

DOI10.1016/0304-3975(87)90137-XzbMath0643.68067OpenAlexW2006823120MaRDI QIDQ1102116

Shigeki Iwata, Takumi Kasai

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90137-x

zbMATH Keywords

Turing machinehalting problemsimple programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Space-bounded reducibility among combinatorial problems
• Relating refined space complexity classes
• Gradually intractable problems and nondeterministic log-space lower bounds
• Some combinatorial game problems require Ω( n ^k ) time
• Classes of Pebble Games and Complete Problems
• Even Simple Programs Are Hard To Analyze

This page was built for publication: Simultaneous (poly-time, log-space) lower bounds