451 search results - page 9 / 91 » Some Lower Bounds on Geometric Separability Problems |
STOC
2010
ACM
15 years 7 months ago
2010
ACM
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
IANDC
2006
14 years 9 months ago
2006
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
78
Voted
ISIPTA
2003
IEEE
15 years 2 months ago
2003
IEEE
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...