Pages that link to "Item:Q4285624"
From MaRDI portal
The following pages link to On completeness for NP via projection translations (Q4285624):
Displaying 5 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Bounded-depth succinct encodings and the structure they imply on graphs (Q722204) (← links)
- A useful transform of standard input data for a classical NP-complete problem (Q1058470) (← links)
- Complete Problems Involving Boolean Labelled Structures and Projection Transactions (Q3988061) (← links)