Publication

New Hardness Results for Diophantine Approximation

Friedrich Eisenbrand, Thomas Rothvoss
2009
Conference Papers

Abstract

We revisit simultaneous diophantine approximation, a classical problem from the geometry of numbers which has many applications in algorithms and complexity. The input of the decision version of this problem consists of a rational vector \alpha, an error bound \epsilon and a denominator bound N. One has to decide whether there exists an integer, called the denominator Q with 1

Official source

https://infoscience.epfl.ch/entities/publication/e26b0c42-1e25-4e3c-a970-2ceea7aef373

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

New Hardness Results for Diophantine Approximation

Chat with Graph Search

The effect of smooth parametrizations on nonconvex optimization landscapes

BENIGN LANDSCAPES OF LOW-DIMENSIONAL RELAXATIONS FOR ORTHOGONAL SYNCHRONIZATION ON GENERAL GRAPHS

Perturbed Utility Stochastic Traffic Assignment