相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。On conversions from CNF to ANF
Jan Horacek et al.
JOURNAL OF SYMBOLIC COMPUTATION (2020)
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers
Masahiko Sakai et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2015)
Construction of an ROBDD for a PB-Constraint in Band Form and Related Techniques for PB-Solvers
Masahiko Sakai et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2015)
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Jesus A. De Loera et al.
JOURNAL OF SYMBOLIC COMPUTATION (2011)
MAXIMIZING A MONOTONE SUBMODULAR FUNCTION SUBJECT TO A MATROID CONSTRAINT
Gruia Calinescu et al.
SIAM JOURNAL ON COMPUTING (2011)
Graph coloring with cardinality constraints on the neighborhoods
M. -C. Costa et al.
DISCRETE OPTIMIZATION (2009)
On probabilistic inference by weighted model counting
Mark Chavira et al.
ARTIFICIAL INTELLIGENCE (2008)
Using linear programming to decode binary linear codes
J Feldman et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
The hardness of 3-uniform hypergraph coloring
I Dinur et al.
COMBINATORICA (2005)
An improved deterministic local search algorithm for 3-SAT
T Brueggemann et al.
THEORETICAL COMPUTER SCIENCE (2004)
Generalizing Boolean satisfiability II: Theory
HE Dixon et al.
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (2004)
A Fourier-theoretic perspective on the Condorcet paradox and Arrow's theorem
G Kalai
ADVANCES IN APPLIED MATHEMATICS (2002)
Local search algorithms for SAT:: An empirical evaluation
HH Hoos et al.
JOURNAL OF AUTOMATED REASONING (2000)
分享论文
