Sciweavers

544 search results - page 61 / 109
» The Algebra of Equality Proofs
Sort
View
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
14 years 2 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber
CSL
2004
Springer
14 years 1 months ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat
ISSAC
2001
Springer
129views Mathematics» more  ISSAC 2001»
14 years 14 days ago
Computation of the degree of rational maps between curves
The degree of a rational map measures how often the map covers the image variety. In particular, when the rational map is a parametrization, the degree measures how often the para...
J. Rafael Sendra, Franz Winkler
KI
2001
Springer
14 years 14 days ago
Experiments with an Agent-Oriented Reasoning System
Abstract. This paper discusses experiments with an agent oriented approach to automated and interactive reasoning. The approach combines ideas from two subfields of AI (theorem pr...
Christoph Benzmüller, Mateja Jamnik, Manfred ...
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
14 years 4 days ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson