Sciweavers

1274 search results - page 58 / 255
» New Proofs for
Sort
View
DCG
2007
78views more  DCG 2007»
13 years 7 months ago
Convexity in Topological Affine Planes
We extend to topological affine planes the standard theorems of convexity, among them the separation theorem, the anti-exchange theorem, Radon’s, Helly’s, Carath´eodory’s,...
Raghavan Dhandapani, Jacob E. Goodman, Andreas Hol...
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
COCOON
2007
Springer
14 years 1 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang
ICCAD
2006
IEEE
138views Hardware» more  ICCAD 2006»
14 years 1 months ago
Stepping forward with interpolants in unbounded model checking
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
Gianpiero Cabodi, Marco Murciano, Sergio Nocco, St...
IJCAI
1993
13 years 9 months ago
On the Polynomial Transparency of Resolution
In this paper a framework is developed for measuring the complexities of deductions in an ab­ stract and computationally perspicuous man­ ner. As a notion of central importance ...
Reinhold Letz