Using the Hamiltonian path operator to capture NP
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4008383 (Why is no real title available?)
- scientific article; zbMATH DE number 4087055 (Why is no real title available?)
- scientific article; zbMATH DE number 43004 (Why is no real title available?)
- scientific article; zbMATH DE number 3467028 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A complexity theory based on Boolean algebra
- Languages that Capture Complexity Classes
- Nondeterministic Space is Closed under Complementation
- Symmetric space-bounded computation
Cited in
(11)- On completeness for NP via projection translations
- Positive versions of polynomial time
- scientific article; zbMATH DE number 139797 (Why is no real title available?)
- Relativized logspace and generalized quantifiers over finite ordered structures
- Complete problems for monotone NP
- Program Schemes with Deep Pushdown Storage
- Context-sensitive transitive closure operators
- Succinct representation, leaf languages, and projection reductions
- On the power of deep pushdown stacks
- Program schemes, arrays, Lindström quantifiers and zero-one laws
- scientific article; zbMATH DE number 88947 (Why is no real title available?)
This page was built for publication: Using the Hamiltonian path operator to capture NP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198664)