Pages that link to "Item:Q5151063"
From MaRDI portal
The following pages link to ON GENERIC NP-COMPLETENESS OF THE BOOLEAN SATISFIABILITY PROBLEM (Q5151063):
Displaying 5 items.
- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k ) (Q3507322) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- ON BINARY SOLUTIONS TO SYSTEMS OF EQUATIONS (Q5151273) (← links)
- ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY (Q5151438) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5205805) (← links)