On lower bounds for the time of computation
From MaRDI portal
Publication:4712356
DOI10.1515/DMA.1991.1.4.391zbMATH Open0790.68047OpenAlexW2008874900MaRDI QIDQ4712356
Publication date: 25 June 1992
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.1991.1.4.391
Related Items (6)
Simultaneous (poly-time, log-space) lower bounds ⋮ Title not available (Why is that?) ⋮ Strong time bounds: Non-computable bounds and a hierarchy theorem ⋮ A note on deterministic and nondeterministic time complexity ⋮ Computing in Finite Time ⋮ Tight bounds on expected time to add correctly and add mostly correctly
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Lower bound for the approximative complexity 👍 👎
- A time lower bound for satisfiability 👍 👎
- Lower time bounds for randomized computation 👍 👎
- On genuinely time bounded computations 👍 👎
- Inferring Lower Bounds for Runtime Complexity 👍 👎
- Automata, Languages and Programming 👍 👎
This page was built for publication: On lower bounds for the time of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4712356)
