371 search results - page 17 / 75 » Partition Theorems and Computability Theory |
106
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
173
Voted
POPL
2008
ACM
16 years 1 days ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
102
click to vote
JCST
2010
14 years 6 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
119
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
130
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
Omnidirectional images arising from 3D-motion of a camera contain persistent structures over a large variation of motions because of their large field of view. This persistence ma...