Pages that link to "Item:Q5492890"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492890):
Displaying 14 items.
- On O(Tlog T) reduction from RAM computations to satisfiability (Q758197) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- On the parameterized complexity of \((k,s)\)-SAT (Q1711421) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
- Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (Q3521946) (← links)
- A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance (Q3563012) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Succinct Permanent Is NEXP-Hard with Many Hard Instances (Q4924648) (← links)
- Theory and Applications of Satisfiability Testing (Q5325861) (← links)
- On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances (Q5369245) (← links)
- Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis (Q5741801) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)