Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492895
DOI10.1007/11549345zbMath1156.68393MaRDI QIDQ5492895
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
90C60: Abstract computational complexity for mathematical programming problems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Introduction to the Maximum Solution Problem, Approximability of clausal constraints, Approximability of the Maximum Solution Problem for Certain Families of Algebras