371 search results - page 24 / 75 » Partition Theorems and Computability Theory |
CORR
2007
Springer
14 years 9 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...
62
Voted
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...
EJC
2000
14 years 9 months ago
2000
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...