The following pages link to STACS 2004 (Q5309710):
Displaying 6 items.
- The complexity of pure literal elimination (Q862401) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Pure Pointer Programs with Iteration (Q3540172) (← links)
- Backdoors into Two Occurrences (Q5014282) (← links)
- Absorbing random walks and the NAE2SAT problem (Q5391499) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)