Molecular computing, bounded nondeterminism, and efficient recursion
From MaRDI portal
Recommendations
Cites work
- Algorithms for maximum independent sets
- Classes of bounded nondeterminism
- CONSTRUCTING LANGUAGE INSTANCES BASED ON PARTIAL INFORMATION
- DNA models and algorithms for NP-complete problems
- Downward Separation Fails Catastrophically for Limited Nondeterminism Classes
- scientific article; zbMATH DE number 17527 (Why is no real title available?)
- scientific article; zbMATH DE number 1306877 (Why is no real title available?)
- scientific article; zbMATH DE number 512827 (Why is no real title available?)
- Natural Self-Reducible Sets
- Nondeterminism within $P^ * $
- On the computational power of DNA
- Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
- Relations Among Complexity Measures
- Solving satisfiability in less than \(2^ n\) steps
Cited in
(9)- Molecular computing, bounded nondeterminism, and efficient recursion
- A comparison of resource-bounded molecular computation models
- Molecular computing paradigm -- toward freedom from Turing's charm
- scientific article; zbMATH DE number 1342097 (Why is no real title available?)
- scientific article; zbMATH DE number 1342101 (Why is no real title available?)
- scientific article; zbMATH DE number 1342107 (Why is no real title available?)
- scientific article; zbMATH DE number 1051372 (Why is no real title available?)
- scientific article; zbMATH DE number 1418472 (Why is no real title available?)
- The emerging discipline of biomolecular computation in the US
This page was built for publication: Molecular computing, bounded nondeterminism, and efficient recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4572009)