Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
Blog
My ScienceOpen
Sign in
Register
Dashboard
Search
Home
Publishing
DrugRxiv
Drug Repurposing
Network Medicine
About
REPO4EU
Meet the team
Drug Repurposing Research Collection
Conference
My ScienceOpen
Sign in
Register
Dashboard
Search
41
views
8
references
Top references
cited by
31
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
4,400
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Theory and Applications of Satisfiability Testing - SAT 2009: 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings
Extending SAT Solvers to Cryptographic Problems
other
Author(s):
Mate Soos
,
Karsten Nohl
,
Claude Castelluccia
Publication date
(Print):
2009
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
8
Record
: found
Abstract
: not found
Article
: not found
A Computing Procedure for Quantification Theory
Martin Davis
,
Hilary Putnam
(1960)
0
comments
Cited
222
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Temporal Induction by Incremental SAT Solving
Niklas Een
,
Niklas Sörensson
(2003)
0
comments
Cited
46
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Nicolas T. Courtois
(2003)
0
comments
Cited
34
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2009
Pages
: 244-257
DOI:
10.1007/978-3-642-02777-2_24
SO-VID:
d71ae51f-bc5e-49a2-908e-36d03b66ebee
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
SAT Modulo Theories: Enhancing SAT with Special-Purpose Algorithms
pp. 2
Symbolic Techniques in Propositional Satisfiability Solving
pp. 4
Efficiently Calculating Evolutionary Tree Measures Using SAT
pp. 18
Finding Lean Induced Cycles in Binary Hypercubes
pp. 32
Finding Efficient Circuits Using SAT-Solvers
pp. 45
Encoding Treewidth into SAT
pp. 51
The Complexity of Reasoning for Fragments of Default Logic
pp. 65
Does Advice Help to Prove Propositional Tautologies?
pp. 73
Backdoors in the Context of Learning
pp. 80
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
pp. 86
On Some Aspects of Mixed Horn Formulas
pp. 101
Variable Influences in Conjunctive Normal Forms
pp. 114
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
pp. 128
An Exponential Lower Bound for Width-Restricted Clause Learning
pp. 141
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
pp. 147
Boundary Points and Resolution
pp. 161
Sequential Encodings from Max-CSP into Partial Max-SAT
pp. 167
Cardinality Networks and Their Applications
pp. 181
New Encodings of Pseudo-Boolean Constraints into CNF
pp. 195
Efficient Term-ITE Conversion for Satisfiability Modulo Theories
pp. 209
On-the-Fly Clause Improvement
pp. 223
Dynamic Symmetry Breaking by Simulating Zykov Contraction
pp. 237
Minimizing Learned Clauses
pp. 244
Extending SAT Solvers to Cryptographic Problems
pp. 258
Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability
pp. 265
A Theoretical Analysis of Search in GSAT
pp. 276
The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT
pp. 284
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
pp. 298
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques
pp. 312
Restart Strategy Selection Using Machine Learning Techniques
pp. 326
Instance-Based Selection of Policies for SAT Solvers
pp. 341
Width-Based Restart Policies for Clause-Learning Satisfiability Solvers
pp. 356
Problem-Sensitive Restart Heuristics for the DPLL Procedure
pp. 363
(1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms
pp. 377
VARSAT: Integrating Novel Probabilistic Inference Techniques with DPLL Search
pp. 391
Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
pp. 398
A Compact Representation for Syntactic Dependencies in QBFs
pp. 412
Beyond CNF: A Circuit-Based QBF Solver
pp. 427
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
pp. 441
Nonlinear Pseudo-Boolean Optimization: Relaxation or Propagation?
pp. 447
Relaxed DPLL Search for MaxSAT
pp. 453
Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
pp. 467
Exploiting Cycle Structures in Max-SAT
pp. 481
Generalizing Core-Guided Max-SAT
pp. 495
Algorithms for Weighted Boolean Optimization
pp. 509
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
pp. 524
c-sat: A Parallel SAT Solver for Clusters
Similar content
4,400
A Unified Spectral Method for FPDEs with Two-sided Derivatives; A Fast Solver
Authors:
M. Samiee
,
M. Meerschaert
ALPACA - a level-set based sharp-interface multiresolution solver for conservation laws
Authors:
Nils Hoppe
,
Josef M. Winter
,
Stefan Adami
…
Performance prediction of finite-difference solvers for different computer architectures
Authors:
Mathias Louboutin
,
Michael Lange
,
Felix J. Herrmann
…
See all similar
Cited by
30
BoSy: An Experimentation Framework for Bounded Synthesis
Authors:
Peter Faymonville
,
Bernd Finkbeiner
,
Leander Tentrup
Automatic Differential Analysis of ARX Block Ciphers with Application to SPECK and LEA
Authors:
Ling Song
,
Zhangjie Huang
,
Qianqian Yang
Efficient Verified (UN)SAT Certificate Checking
Authors:
Peter Lammich
See all cited by