Pages that link to "Item:Q3576044"
From MaRDI portal
The following pages link to Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044):
Displayed 6 items.
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)