scientific article; zbMATH DE number 4205978
From MaRDI portal
Publication:3355230
Recommendations
- Almost-everywhere complexity hierarchies for nondeterministic time
- A note on deterministic and nondeterministic time complexity
- Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility
- Strong time bounds: Non-computable bounds and a hierarchy theorem
- scientific article; zbMATH DE number 2019635
- A Time Hierarchy Theorem for Nondeterministic Cellular Automata
- Pseudodeterministic algorithms and the structure of probabilistic time
- A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
- scientific article; zbMATH DE number 1223631
- CONCUR 2005 – Concurrency Theory
Cited in
(13)- Implicit characterizations of FPTIME and NC revisited
- A note on the best-case complexity
- Almost-everywhere complexity hierarchies for nondeterministic time
- Sharply bounded alternation and quasilinear time
- A note on deterministic and nondeterministic time complexity
- scientific article; zbMATH DE number 4010508 (Why is no real title available?)
- An application of the translational method
- scientific article; zbMATH DE number 1975376 (Why is no real title available?)
- On randomized versus deterministic computation
- Lower space bounds for randomized computation
- New time hierarchy results for deterministic TMS
- Pseudodeterministic algorithms and the structure of probabilistic time
- Strong time bounds: Non-computable bounds and a hierarchy theorem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355230)
