Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492889
DOI10.1007/11549345zbMath1156.68403OpenAlexW2494705596MaRDI QIDQ5492889
Endre Boros, Khaled M. Elbassioni, Vladimir A. Gurvich, Leonid G. Khachiyan
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
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
This page was built for publication: Mathematical Foundations of Computer Science 2005