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

DOI10.1016/0304-3975(87)90137-XMaRDI QIDQ1102116zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Time-space lower bounds for satisfiability
• Time-space lower bounds for satisfiability
• scientific article; zbMATH DE number 2156275
• On lower bounds for the time of computation
• A time lower bound for satisfiability
• Automata, Languages and Programming
• Parallel time and space upper-bounds for the subset-sum problem
• Time‐Space Lower Bounds for the Polynomial‐Time Hierarchy on Randomized Machines
• Automata, Languages and Programming
• Simple PCPs with poly-log rate and query complexity

Cites work

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

Cited in

(2)

• scientific article; zbMATH DE number 4049059 (Why is no real title available?)
• Simple PCPs with poly-log rate and query complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102116)