Pages that link to "Item:Q3524229"
From MaRDI portal
The following pages link to Towards an Optimal CNF Encoding of Boolean Cardinality Constraints (Q3524229):
Displaying 50 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- A nonexistence certificate for projective planes of order ten with weight 15 codewords (Q780361) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- maxSAT-based large neighborhood search for high school timetabling (Q1652069) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
- Intra- and interdiagram consistency checking of behavioral multiview models (Q1749133) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Encoding cardinality constraints using multiway merge selection networks (Q2009191) (← links)
- Optimal symmetry breaking for graph problems (Q2009225) (← links)
- Real-time solving of computationally hard problems using optimal algorithm portfolios (Q2043446) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- Propagation complete encodings of smooth DNNF theories (Q2079276) (← links)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
- A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis (Q2170083) (← links)
- Coupling different integer encodings for SAT (Q2170178) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Computing properties of stable configurations of thermodynamic binding networks (Q2315010) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- On an MCS-based inconsistency measure (Q2374545) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
- Delegatable Functional Signatures (Q2798783) (← links)
- Automatic Search of Linear Trails in ARX with Applications to SPECK and Chaskey (Q2822690) (← links)
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Formal Analysis of the Entropy / Security Trade-off in First-Order Masking Countermeasures against Side-Channel Attacks (Q3104720) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis (Q3186608) (← links)
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF (Q3453205) (← links)
- GAC Via Unit Propagation (Q3523055) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Encoding Treewidth into SAT (Q3637156) (← links)
- Sequential Encodings from Max-CSP into Partial Max-SAT (Q3637165) (← links)
- Cardinality Networks and Their Applications (Q3637166) (← links)
- New Encodings of Pseudo-Boolean Constraints into CNF (Q3637167) (← links)
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178) (← links)
- Boolean satisfiability in quantum compilation (Q4993497) (← links)
