CNF Encodings of Symmetric Functions
- 26 March 2024
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (5) , 1-21
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Huawei (TC20211214628)
This publication has 20 references indexed in Scilit:
- SAT Encodings of the At-Most-k Constraint2019
- A lower bound on CNF encodings of the at-most-one constraintTheoretical Computer Science, 2019
- PySAT: A Python Toolkit for Prototyping with SAT Oracles2018
- Boolean Function Complexity2012
- New upper bounds on the Boolean circuit complexity of symmetric functionsInformation Processing Letters, 2010
- Towards Robust CNF Encodings of Cardinality Constraints2007
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints2005
- Efficient CNF Encoding of Boolean Cardinality Constraints2003
- Graph-theoretic arguments in low-level complexity1977
- On the Complexity of Derivation in Propositional Calculus1970