Sciweavers

12774 search results - page 89 / 2555
» A Framework for Proof Systems
Sort
View
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 6 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
LFCS
2007
Springer
14 years 3 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
14 years 3 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
PR
2007
111views more  PR 2007»
13 years 8 months ago
Design and formal proof of a new optimal image segmentation program with hypermaps
This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an opt...
Jean-François Dufourd
BIRTHDAY
2004
Springer
14 years 2 months ago
A Proof of Regularity for Finite Splicing
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
Vincenzo Manca