52 search results - page 1 / 11 » Characterizing Provability in |
LPAR
2005
Springer
13 years 10 months ago
2005
Springer
APAL
2011
12 years 12 months ago
2011
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
JSYML
2008
13 years 4 months ago
2008
In this paper we give a new proof of the characterization of the closed fragment of the provability logic of Heyting's Arithmetic. We also provide a characterization of the c...
FC
2007
Springer
13 years 11 months ago
2007
Springer
Onion routing is a scheme for anonymous communication that is designed for practical use. Until now, however, it has had no formal model and therefore no rigorous analysis of its a...
CVPR
2000
IEEE
13 years 9 months ago
2000
IEEE
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...