Pages that link to "Item:Q1711421"
From MaRDI portal
The following pages link to On the parameterized complexity of \((k,s)\)-SAT (Q1711421):
Displaying 8 items.
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for<i>K</i>-SAT at large clause-to-variable ratios (Q3425245) (← links)
- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k ) (Q3507322) (← links)
- The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT (Q3637173) (← links)
- On the <i>K</i>‐sat model with large number of clauses (Q4642745) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492890) (← links)
- On approximability of satisfiable <i>k</i> -CSPs: I (Q6083552) (← links)
