Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.68401OpenAlexW2494705596MaRDI QIDQ5492876

Matthias Hagen, Judy Goldsmith, Martin Mundhenk

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 (2)

DP-Complete Problems Derived from Extremal NP-Complete Properties ⋮ Complexity of DNF minimization and isomorphism testing for monotone formulas

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