1092 search results - page 149 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
187
click to vote
FLOPS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
160
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
219
click to vote
ICDT
2012
ACM
13 years 8 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
234
click to vote
CVIU
2011
14 years 9 months ago
2011
Abstract—In this paper, three approaches to utilizing objectlevel spatial contextual information for semantic image analysis are presented and comparatively evaluated. Contextual...
177
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...