5084 search results - page 184 / 1017 » Proving Possibility Properties |
161
click to vote
LFCS
1992
Springer
15 years 10 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
149
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
164
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We describe a formal verification of a recent concurrent list-based set algorithm due to Heller et al. The algorithm is optimistic: the add and remove operations traverse the list ...
199
click to vote
TLCA
1995
Springer
15 years 10 months ago
1995
Springer
operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a ...
196
click to vote
FSTTCS
1991
Springer
15 years 10 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...