Simultaneous (poly-time, log-space) lower bounds
From MaRDI portal
Publication:1102116
DOI10.1016/0304-3975(87)90137-XzbMATH Open0643.68067OpenAlexW2006823120MaRDI QIDQ1102116FDOQ1102116
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
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
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Even Simple Programs Are Hard To Analyze
- Space-bounded reducibility among combinatorial problems
- Relating refined space complexity classes
- Some combinatorial game problems require Ω( n k ) time
- Classes of Pebble Games and Complete Problems
- Gradually intractable problems and nondeterministic log-space lower bounds
Cited In (2)
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)
