3571 search results - page 243 / 715 » Cohen and Set Theory |
149
click to vote
ACL
1994
15 years 8 months ago
1994
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
156
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
152
click to vote
AML
2006
15 years 6 months ago
2006
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
141
click to vote
IPL
2008
15 years 6 months ago
2008
The Chernoff-Hoeffding bounds are fundamental probabilistic tools. An elementary approach is presented to obtain a Chernoff-type upper-tail bound for the number of prime factors o...