57 search results - page 5 / 12 » Invisible Genericity and 0 |
SIAMCOMP
2000
13 years 7 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
ICONIP
1998
13 years 8 months ago
1998
This paper describes the implementation of a system that reminds the user of the telephone number of a given list, even if the user only remembers part of it, or if the given numb...
TYPES
1998
Springer
13 years 11 months ago
1998
Springer
We define a generic notion of cut that applies to many first-order theories. We prove a generic cut elimination theorem showing that the cut elimination property holds for all theo...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP do...
DCG
2008
13 years 7 months ago
2008
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...