scientific article; zbMATH DE number 44418
From MaRDI portal
Publication:3993545
circuitscomplete problemscomplexity theoryNP-completenessparallel computersprocessor networksrandom access machinestime versus place problemTuring machines
Complexity of computation (including implicit computational complexity) (03D15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)
Cited in
(11)- Unambiguity of circuits
- On computation with pulses
- Time-space tradeoffs for satisfiability
- scientific article; zbMATH DE number 3952713 (Why is no real title available?)
- scientific article; zbMATH DE number 1216160 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1542049 (Why is no real title available?)
- Pattern matching in trace monoids (extended abstract)
- The complexity theory companion
- Linear speed-up does not hold on Turing machines with tree storages
- Foundations of \(r\)-contiguous matching in negative selection for anomaly detection
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 Q3993545)
