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

C
Capelli, Florent	Structure-based knowledge compilation: the singular case of $\beta$-acyclic formulas
D
Dell, Holger	Complexity and Approximability for Parameterized MAXCSPs
E
Eiben, Eduard	Using Decomposition-Parameters for QBF: Mind the Prefix!
G
Ganian, Robert	Using Decomposition-Parameters for QBF: Mind the Prefix!
Giráldez-Cru, Jesus	Pseudo-Industrial Random SAT Generators
I
Iwata, Yoichi	CNF Encoding of Cardinality Constraints via Tree-Decomposition
J
Jamali, Sima	Experiments with CNF Structure and Hardness
K
Kim, Eunjung	Complexity and Approximability for Parameterized MAXCSPs
Kullmann, Oliver	Minimal unsatisfiability and deficiency: recent developments
L
Lampis, Michael	Complexity and Approximability for Parameterized MAXCSPs
Levy, Jordi	Pseudo-Industrial Random SAT Generators
M
Mcbride, Ryan	Experiments with CNF Structure and Hardness
Mitchell, David	Experiments with CNF Structure and Hardness
Mitsou, Valia	Complexity and Approximability for Parameterized MAXCSPs
Mömke, Tobias	Complexity and Approximability for Parameterized MAXCSPs
O
Ordyniak, Sebastian	Using Decomposition-Parameters for QBF: Mind the Prefix!
S
Szeider, Stefan	Capturing Structure in SAT and Related Problems

Disclaimer | Powered by EasyChair Smart Program