New Hardness Results for Diophantine Approximation

DOI10.1007/978-3-642-03685-9_8zbMath1254.68349OpenAlexW1852633567MaRDI QIDQ3638871

Friedrich Eisenbrand, Thomas Rothvoß

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: http://cui.unige.ch/tcs/random-approx/2009/index.php

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (4)

The Computational Complexity of Integer Programming with Alternations ⋮ Mixing polyhedra with two non divisible coefficients ⋮ About the Structure of the Integer Cone and Its Application to Bin Packing ⋮ The mixing set with divisible capacities: a simple approach

This page was built for publication: New Hardness Results for Diophantine Approximation