998 search results - page 2 / 200 » From Feasible Proofs to Feasible Computations |
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
WOLLIC
2010
Springer
13 years 10 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
FCCM
2007
IEEE
13 years 8 months ago
2007
IEEE
While medium- and large-sized computing centers have increasingly relied on clusters of commodity PC hardware to provide cost-effective capacity and capability, it is not clear th...
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...
GPC
2007
Springer
13 years 11 months ago
2007
Springer
A grid has to provide strong incentive for participating sites to join and stay in it. Participating sites are concerned with the performance improvement brought by the gird for th...