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