13383 search results - page 147 / 2677 » Abstractions from proofs |
167
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...
227
Voted
JLP
2008
15 years 6 months ago
2008
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
143
Voted
JUCS
2006
15 years 6 months ago
2006
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
167
click to vote
PRICAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the problem of computing optimal plans for propositional planning problems with action costs. In the spirit of leveraging advances in general-purpose automate...
154
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
ly correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a "not equals" relationship between terms and also to have ...