787 search results - page 14 / 158 » Polynomial Constants are Decidable |
MLDM
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
FOCS
1999
IEEE
14 years 8 days ago
1999
IEEE
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
TAMC
2007
Springer
14 years 2 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strin...