Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex
Related publications (35)
Graph Chatbot
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.
Let S and S′ be compact Riemann surfaces of the same genus g (gge2) endowed with the Poincaré metric of constant negative curvature -1. par The authors show that for every epsilon>0, there exists an integer m=m(g,epsilon) with the property: Assum ...
Using simple examples and informal discussions this article surveys the key ideas and major advances of the last quarter century in integer factorization. ...
The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...
Institute of Electrical and Electronics Engineers2005
We consider the following integer feasibility problem: Given positive integer numbers a0, a1,&mellip;,an with gcd(a1,&mellip;,an) = 1 and a = (a1,&mellip;,an), does there exist a ...
The number field sieve is an algorithm to factor integers of the form re−s for small positive r and s. The authors present a report on work in progress on this algorithm. They informally describe the algorithm, discuss several implementation related ...
