4 search results - page 1 / 1 » Counting complexity classes for numeric computations II: alg... |
STOC
2004
ACM
14 years 5 months ago
2004
ACM
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
PODS
2004
ACM
14 years 4 months ago
2004
ACM
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...