787 search results - page 97 / 158 » Polynomial Constants are Decidable |
SODA
2012
ACM
12 years 1 days ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
ICTAC
2009
Springer
13 years 7 months ago
2009
Springer
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting,...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
IPL
2007
13 years 9 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
DBPL
1997
Springer
14 years 1 months ago
1997
Springer
We consider spatial databases that can be defined in terms of polynomial inequalities, and we are interested in monotonic transformations of spatial databases. We investigate a hi...