Deciding According to the Shortest Computations

DOI10.1007/978-3-642-21875-0_20zbMath1344.68087OpenAlexW83397938MaRDI QIDQ3091456

Florin Manea

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21875-0_20

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Complexity results for deciding networks of evolutionary processors

Cites Work

• Unnamed Item
• Unnamed Item
• A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors
• More complicated questions about maxima and minima, and some closures of NP
• Bounded Query Classes
• Exact analysis of Dodgson elections
• On the Computational Complexity of Algorithms
• A Computational Complexity Theory in Membrane Computing

This page was built for publication: Deciding According to the Shortest Computations