Pages that link to "Item:Q673091"
From MaRDI portal
The following pages link to The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness (Q673091):
Displaying 13 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Expressive power of digraph solvability (Q409316) (← links)
- Finding kernels or solving SAT (Q414435) (← links)
- Kernels in digraphs that are not kernel perfect (Q442354) (← links)
- Propositional discourse logic (Q484942) (← links)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- On unique graph 3-colorability and parsimonious reductions in the plane (Q596079) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- The cardinality constrained covering traveling salesman problem (Q1869889) (← links)
- Argumentation frameworks as constraint satisfaction problems (Q2248522) (← links)
- A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
- Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview (Q4953235) (← links)
