Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68404OpenAlexW2494705596MaRDI QIDQ5492890

Stefan Richter, Joachim Kneis, Daniel Mölle, Peter Rossmanith

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Improved exact algorithms for mildly sparse instances of MAX SAT ⋮ Solving sparse instances of Max SAT via width reduction and greedy restriction ⋮ Kernelization: New Upper and Lower Bound Techniques

This page was built for publication: Mathematical Foundations of Computer Science 2005