Pages that link to "Item:Q1198664"
From MaRDI portal
The following pages link to Using the Hamiltonian path operator to capture NP (Q1198664):
Displaying 9 items.
- Complete problems for monotone NP (Q673092) (← links)
- On the power of deep pushdown stacks (Q1037618) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Program schemes, arrays, Lindström quantifiers and zero-one laws (Q1606129) (← links)
- Program Schemes with Deep Pushdown Storage (Q3507414) (← links)
- On completeness for NP via projection translations (Q4285624) (← links)
- Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054) (← links)
