Sciweavers

325 search results - page 18 / 65
» Proofs of Restricted Shuffles
Sort
View
AAAI
2008
14 years 5 days ago
On the Power of Top-Down Branching Heuristics
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...
Matti Järvisalo, Tommi A. Junttila
BMCBI
2005
117views more  BMCBI 2005»
13 years 9 months ago
Graph-representation of oxidative folding pathways
Background: The process of oxidative folding combines the formation of native disulfide bond with conformational folding resulting in the native three-dimensional fold. Oxidative ...
Vilmos Ágoston, Masa Cemazar, Lászl&...
CSL
2010
Springer
13 years 11 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
14 years 3 months ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
FSTTCS
2004
Springer
14 years 3 months ago
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn