Back to Results
First PageMeta Content
Computational complexity theory / Diophantine approximation / Approximation algorithm


New Hardness Results for Diophantine Approximation Friedrich Eisenbrand & Thomas Rothvoß Institute of Mathematics EPFL, Lausanne
Add to Reading List

Document Date: 2013-11-01 17:11:36


Open Document

File Size: 268,62 KB

Share Result on Facebook