SAT 2016: 19TH INTERNATIONAL CONFERENCE ON THEORY AND APPLICATIONS OF SATISFIABILITY TESTING

This page contains an index consisting of author-provided keywords.

B
B2B	A Study on Implied Constraints in a MaxSAT Approach to B2B Problems
benchmark analysis	Better Evaluations by Analyzing Benchmark Structure
C
CDCL heuristics	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
Clashing-Neighbor Relation	The Clashing-Neighbor Relation for Propositional Formulas
Cluster Analysis	The Clashing-Neighbor Relation for Propositional Formulas
Cryptanalysis	Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
D
diversification	Approximate History Map for Massively Parallel Environments
E
Eigenvector Analysis	The Clashing-Neighbor Relation for Propositional Formulas
H
Hash functions	Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
history map	Approximate History Map for Massively Parallel Environments
I
implied constraints	A Study on Implied Constraints in a MaxSAT Approach to B2B Problems
improve evaluation	Better Evaluations by Analyzing Benchmark Structure
M
MaxSAT encodings	A Study on Implied Constraints in a MaxSAT Approach to B2B Problems
P
proof complexity	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks
Propositional Formulas	The Clashing-Neighbor Relation for Propositional Formulas
S
SAT solvers	Adaptive Restart and CEGAR-based Solver for Inverting Cryptographic Hash Functions
search space	Approximate History Map for Massively Parallel Environments
solver evaluation	Better Evaluations by Analyzing Benchmark Structure
T
Theoretical benchmarks	Seeking Practical CDCL Insights from Theoretical SAT Benchmarks

Disclaimer | Powered by EasyChair Smart Program