Sciweavers

1058 search results - page 125 / 212
» It's Doomed; We Can Prove It
Sort
View
FROCOS
2009
Springer
14 years 1 months ago
Efficient Combination of Decision Procedures for MUS Computation
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
Cédric Piette, Youssef Hamadi, Lakhdar Sais
CIE
2006
Springer
14 years 1 months ago
Forcing with Random Variables and Proof Complexity
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
Jan Krajícek
ECIR
2004
Springer
13 years 11 months ago
Fault-Tolerant Fulltext Information Retrieval in Digital Multilingual Encyclopedias with Weighted Pattern Morphing
This paper introduces a new approach to add fault-tolerance to a fulltext retrieval system. The weighted pattern morphing technique circumvents some of the disadvantages of the wid...
Wolfram M. Esser
INFORMATICALT
2006
177views more  INFORMATICALT 2006»
13 years 10 months ago
Cryptanalysis and Improvement of Practical Convertible Authenticated Encryption Schemes Using Self-Certified Public Keys
A convertible authenticated encryption scheme allows a specified recipient to recover and verify a message simultaneously. Moreover the recipient can prove the dishonesty of the se...
Zuhua Shao
AMC
2005
138views more  AMC 2005»
13 years 10 months ago
Practical convertible authenticated encryption schemes using self-certified public keys
A convertible authenticated encryption scheme allows a designated receiver to recover and verify a message simultaneously, during which the recipient can prove the dishonesty of t...
Jiqiang Lv, Xinmei Wang, Kwangjo Kim