923 search results - page 114 / 185 » On a generalization of Stickelberger's Theorem |
MPC
1995
Springer
15 years 3 months ago
1995
Springer
PVS is a highly automated framework for speci cation and veri cation. We show how the language and deduction features of PVS can be used to formalize, mechanize, and apply some us...
119
click to vote
TABLEAUX
1995
Springer
15 years 3 months ago
1995
Springer
In constraint logic programming, proof procedures for Horn clauses are enhanced with an interface to efficient constraint solvers. In this paper we show how to incorporate constra...
120
click to vote
FSTTCS
1991
Springer
15 years 3 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
CADE
2005
Springer
15 years 1 months ago
2005
Springer
We present the CoRe calculus for contextual reasoning which supports reasoning directly at the assertion level, where proof steps are justified in terms of applications of defini...
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...