3341 search results - page 145 / 669 » On Bounded Queries and Approximation |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we give reconstruction algorithms for depth-3 arithmetic circuits with k multiplication gates (also known as ΣΠΣ(k) circuits), where k = O(1). Namely, we give an ...
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...
101
Voted
DLOG
2011
14 years 1 months ago
2011
We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , thus improving the previously known 2ExpTime lower bound. The result transfers to ...
ESCAPE
2007
Springer
15 years 4 months ago
2007
Springer
We present deterministic sub-linear space algorithms for a number of problems over update data streams, including, estimating frequencies of items and ranges, finding approximate ...