We revisit classical geometric search problems under the assumption of rational coordinates. Our main result is a tight bound for point separation, ie, to determine whether n given...
We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree ...
We present an algorithm for generating the Voronoi cells for a set of rational C1 -continuous planar closed curves, which is precise up to machine precision. Initially, bisectors ...
Iddo Hanniel, Ramanathan Muthuganapathy, Gershon E...
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...