3552 search results - page 369 / 711 » Proof theory in the abstract |
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
162
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
172
click to vote
AMC
2006
15 years 6 months ago
2006
``Church's thesis'' is at the foundation of computer science. We point out that with any particular set of physical laws, Church's thesis need not merely be po...
164
click to vote
AML
2006
15 years 6 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
139
click to vote
CAGD
2006
15 years 6 months ago
2006
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...