Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
18 | Anastasia Sofronova, Dmitry Sokolov 0001 |
A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
18 | Till Tantau |
On the Satisfaction Probability of k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.08895, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
18 | Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin |
CNF Encodings of Parity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.01082, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Alexander A. Sherstov |
The Approximate Degree of DNF and CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.01584, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Kun He 0011, Kewen Wu 0001, Kuan Yang |
Improved Bounds for Sampling Solutions of Random CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.11892, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Gongxian Zeng, Junzuo Lai, Zhengan Huang, Yu Wang, Zhiming Zheng 0001 |
DAG-Σ: A DAG-based Sigma Protocol for Relations in CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1569, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
18 | Dinh Tam Nguyen, Ngoc Lam Dao, Van Thuyet Tran, Khac Thuan Lang, Thanh-Tu Pham, Phi Hung Nguyen, Cong Dan Pham, Tuan Anh Pham, Duc Hai Nguyen 0003, Huu-Thanh Nguyen 0001 |
Enhancing CNF performance for 5G core network using SR-IOV in Kubernetes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICACT ![In: 24th International Conference on Advanced Communication Technology, ICACT 2022, Pyeongchang, Korea, February 13-16, 2022, pp. 501-506, 2022, IEEE, 979-11-88428-08-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Federico Chesani, Chiara Di Francescomarino, Chiara Ghidini, Daniela Loreti, Fabrizio Maria Maggi, Paola Mello, Marco Montali, Elena Palmieri, Sergio Tessaris |
Discovering Business Processes models expressed as DNF or CNF formulae of Declare constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CILC ![In: Proceedings of the 37th Italian Conference on Computational Logic, Bologna, Italy, June 29 - July 1, 2022., pp. 201-216, 2022, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
18 | Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin |
CNF Encodings of Parity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria., pp. 47:1-47:12, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-256-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Gongxian Zeng, Junzuo Lai, Zhengan Huang, Yu Wang, Zhiming Zheng 0001 |
DAG-Σ: A DAG-Based Sigma Protocol for Relations in CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT (2) ![In: Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, December 5-9, 2022, Proceedings, Part II, pp. 340-370, 2022, Springer, 978-3-031-22965-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel |
Certified CNF Translations for Pseudo-Boolean Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: 25th International Conference on Theory and Applications of Satisfiability Testing, SAT 2022, August 2-5, 2022, Haifa, Israel., pp. 16:1-16:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-242-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky |
CNF-FSS and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography (1) ![In: Public-Key Cryptography - PKC 2022 - 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8-11, 2022, Proceedings, Part I, pp. 283-314, 2022, Springer, 978-3-030-97120-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Ruiwei Wang, Roland H. C. Yap |
CNF Encodings of Binary Constraint Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, July 31 to August 8, 2022, Haifa, Israel., pp. 40:1-40:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-240-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Elias Kuiter, Sebastian Krieter, Chico Sundermann, Thomas Thüm, Gunter Saake |
Tseitin or not Tseitin? The Impact of CNF Transformations on Feature-Model Analyses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASE ![In: 37th IEEE/ACM International Conference on Automated Software Engineering, ASE 2022, Rochester, MI, USA, October 10-14, 2022, pp. 110:1-110:13, 2022, ACM, 978-1-4503-9475-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Alexander A. Sherstov |
The approximate degree of DNF and CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 1194-1207, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Sergey I. Uvarov |
Empirical Evaluation of the Asymptotic Behavior of the Analysis Complexity of Hard Random 3-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLIS ![In: Machine Learning and Artificial Intelligence - Proceedings of MLIS 2022, Virtual Event, Korea, 8-11 November 2022., pp. 28-34, 2022, IOS Press, 978-1-64368-356-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Till Tantau |
On the Satisfaction Probability of k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 2:1-2:27, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino |
Generating clause sequences of a CNF formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 856, pp. 68-74, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Vikraman Arvind, Venkatesan Guruswami |
CNF Satisfiability in a Subspace and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Manoj Kumar |
Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and its Implications on P versus NP problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.05597, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Michael C. Chavrimootoo, Henry B. Welles |
A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP problem.". ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.06062, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Vikraman Arvind, Venkatesan Guruswami |
CNF Satisfiability in a Subspace and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.05914, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Hazem J. Alkhatib, Majd N. Bohssas, Rawad H. Hatem, Odey N. Kassam Alhennawi |
A New Approach to CNF-SAT From a Probabilistic Point of View. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.11233, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky |
CNF-FSS and its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 163, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
18 | Lázaro Alberto Larrauri |
Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 31(2), pp. 444-472, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang |
Counting Solutions to Random CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 50(6), pp. 1701-1738, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Steven D. Prestwich |
CNF Encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Satisfiability ![In: Handbook of Satisfiability - Second Edition, pp. 75-100, 2021, IOS Press, 978-1-64368-160-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Stephan Gocht, Jakob Nordström, Ruben Martins |
Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
PxTP ![In: Proceedings Seventh Workshop on Proof eXchange for Theorem Proving, PxTP 2021, Pittsburg, PA, USA, July 11, 2021., pp. 48, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Viorel Iordache, Stefan Ciobaca |
Verifying the Conversion into CNF in Dafny. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information, and Computation - 27th International Workshop, WoLLIC 2021, Virtual Event, October 5-8, 2021, Proceedings, pp. 150-166, 2021, Springer, 978-3-030-88852-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Hokeun Lim, Younghan Kim 0002 |
A Design of Service Function Chaining with VNF and CNF on Cloud Native Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTC ![In: International Conference on Information and Communication Technology Convergence, ICTC 2021, Jeju Island, Korea, Republic of, October 20-22, 2021, pp. 1467-1469, 2021, IEEE, 978-1-6654-2383-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Sergey I. Uvarov |
About Strong Dependence of the Complexity of Analysis of the Random 3-CNF Formulas on the Ratio of Number of Clauses to the Number of Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MMBD/MLIS ![In: Modern Management based on Big Data II and Machine Learning and Intelligent Systems III - Proceedings of MMBD 2021 and MLIS 2021, Virtual Event, China, 8-11 November 2021., pp. 496-501, 2021, IOS Press, 978-1-64368-224-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Paolo Fantozzi, Luigi Laura, Umberto Nanni, Alessandro Villa |
Non-isomorphic CNF Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCAI (1) ![In: Distributed Computing and Artificial Intelligence, Volume 1: 18th International Conference, DCAI 2021, Salamanca, Spain, 6-8 October 2021., pp. 98-107, 2021, Springer, 978-3-030-86260-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Arcchit Jain, Clément Gautrais, Angelika Kimmig, Luc De Raedt |
Learning CNF Theories Using MDL and Predicate Invention. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, IJCAI 2021, Virtual Event / Montreal, Canada, 19-27 August 2021., pp. 2599-2605, 2021, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Vikraman Arvind, Venkatesan Guruswami |
CNF Satisfiability in a Subspace and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021, September 8-10, 2021, Lisbon, Portugal., pp. 5:1-5:15, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-216-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
18 | Ryo Okishima, Toru Nakanishi 0001 |
An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 103-A(12), pp. 1381-1392, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Haoyu Ren, Mostafa El-Khamy, Jungwon Lee |
CNF+CT: Context Network Fusion of Cascade-Trained Convolutional Neural Networks for Image Super-Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computational Imaging ![In: IEEE Trans. Computational Imaging 6, pp. 447-462, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich |
Generating Difficult CNF Instances in Unexplored Constrainedness Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 25, pp. 1-12, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Romain Wallon, Stefan Mengel |
Revisiting Graph Width Measures for CNF-Encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 67, pp. 409-436, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Lázaro Alberto Larrauri |
Probabilities of first order sentences on sparse random relational structures: An application to definability on random CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.06099, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
18 | Marcel Rémon, Johan Barthélemy |
Hard 3-CNF-SAT problems are in P - A first step in proving NP=P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.00760, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
18 | Kristóf Bérczi, Endre Boros, Ondrej Cepek, Khaled M. Elbassioni, Petr Kucera, Kazuhisa Makino |
Generating clause sequences of a CNF formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.06727, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
18 | S. I. Uvarov |
An Improved Generator for 3-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. Remote. Control. ![In: Autom. Remote. Control. 81(1), pp. 130-138, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Zufeng Fu, Daoyun Xu, Yongping Wang |
(1, 0)-Super Solutions of (k, s)-CNF Formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 22(2), pp. 253, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Montserrat Hermo, Ana Ozaki |
Exact Learning: On the Boundary between Horn and CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 12(1), pp. 4:1-4:25, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Md Lutfar Rahman, Thomas Watson 0001 |
Complexity of Unordered CNF Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 12(3), pp. 18:1-18:18, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Jan Horácek, Martin Kreuzer |
On conversions from CNF to ANF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 100, pp. 164-186, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Mate Soos, Stephan Gocht, Kuldeep S. Meel |
Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (1) ![In: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part I, pp. 463-484, 2020, Springer, 978-3-030-53287-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Domenico Cantone, Andrea De Domenico, Pietro Maugeri, Eugenio G. Omodeo |
A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CILC ![In: Proceedings of the 35th Italian Conference on Computational Logic - CILC 2020, Rende, Italy, October 13-15, 2020., pp. 214-230, 2020, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
18 | Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang |
Counting Solutions to Random CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 53:1-53:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Andrea Lincoln, Adam Yedidia |
Faster Random k-CNF Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 78:1-78:12, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Giorgio Ausiello, Francesco Cristiano, Paolo Fantozzi, Luigi Laura |
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTCS ![In: Proceedings of the 21st Italian Conference on Theoretical Computer Science, Ischia, Italy, September 14-16, 2020., pp. 190-201, 2020, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
18 | Aolong Zha, Rongxuan Gao, Qiong Chang, Miyuki Koshimura, Itsuki Noda |
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 32nd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, Baltimore, MD, USA, November 9-11, 2020, pp. 285-292, 2020, IEEE, 978-1-7281-9228-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Kunho Kim, Athar Sefid, C. Lee Giles |
Learning CNF Blocking for Large-scale Author Name Disambiguation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SDP@EMNLP ![In: Proceedings of the First Workshop on Scholarly Document Processing, SDP@EMNLP 2020, Online, November 19, 2020, pp. 72-80, 2020, Association for Computational Linguistics, 978-1-952148-70-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Md Lutfar Rahman, Thomas Watson 0001 |
Tractable Unordered 3-CNF Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings, pp. 360-372, 2020, Springer, 978-3-030-61791-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
18 | Petr Kucera, Petr Savický |
On the size of CNF formulas with high propagation strength. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2020, Fort Lauderdale, Florida, USA, January 6-8, 2020., 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
18 | Chao Xu 0010, Jianer Chen, Jianxin Wang 0001 |
Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 774, pp. 113-123, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Petr Kucera, Petr Savický, Vojtech Vorel |
A lower bound on CNF encodings of the at-most-one constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 762, pp. 51-73, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Md Lutfar Rahman, Thomas Watson 0001 |
Tractable Unordered 3-CNF Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Michal Karpinski |
CNF Encodings of Cardinality Constraints Based on Comparator Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.00586, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang |
Counting solutions to random CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.07020, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Maen Alzubi, Szilveszter Kovács |
Some Considerations and a Benchmark Related to the CNF Property of the Koczy-Hirota Fuzzy Rule Interpolation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.05041, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Stefan Mengel, Romain Wallon |
Revisiting Graph Width Measures for CNF-Encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.05290, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Andrea Calì, Igor Razgon |
Regular resolution for CNF of bounded incidence treewidth with few long clauses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.10867, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Andrea Lincoln, Adam Yedidia |
Faster Random k-CNF Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.10618, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Huang Zhang, Fangguo Zhang, Rong Cheng, Haibo Tian |
Efficient obfuscation for CNF circuits and applications in cloud computing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 23(6), pp. 2061-2072, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Rotem Tsabary |
Fully Secure Attribute-Based Encryption for t-CNF from LWE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2019, pp. 365, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Daniel Berend, Dor Bitan, Shlomi Dolev |
Polynomials Whose Secret Shares Multiplication Preserves Degree for 2-CNF Circuits Over a Dynamic Set of Secrets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2019, pp. 1192, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
18 | Aolong Zha, Miyuki Koshimura, Hiroshi Fujita 0002 |
N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 24(2), pp. 133-161, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel |
Bosphorus: Bridging ANF and CNF Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Design, Automation & Test in Europe Conference & Exhibition, DATE 2019, Florence, Italy, March 25-29, 2019, pp. 468-473, 2019, IEEE, 978-3-9819263-2-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Mate Soos, Kuldeep S. Meel |
BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019., pp. 1592-1599, 2019, AAAI Press, 978-1-57735-809-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Stefan Mengel, Romain Wallon |
Revisiting Graph Width Measures for CNF-Encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2019 - 22nd International Conference, SAT 2019, Lisbon, Portugal, July 9-12, 2019, Proceedings, pp. 222-238, 2019, Springer, 978-3-030-24257-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Yakoub Salhi |
On Enumerating All the Minimal Models for Particular CNF Formula Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAART (2) ![In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART 2019, Volume 2, Prague, Czech Republic, February 19-21, 2019., pp. 403-410, 2019, SciTePress, 978-989-758-350-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Ryo Okishima, Toru Nakanishi 0001 |
An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWSEC ![In: Advances in Information and Computer Security - 14th International Workshop on Security, IWSEC 2019, Tokyo, Japan, August 28-30, 2019, Proceedings, pp. 89-106, 2019, Springer, 978-3-030-26833-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | David E. Narváez |
Formalizing CNF SAT Symmetry Breaking in PVS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NFM ![In: NASA Formal Methods - 11th International Symposium, NFM 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, pp. 341-354, 2019, Springer, 978-3-030-20651-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Rotem Tsabary |
Fully Secure Attribute-Based Encryption for t-CNF from LWE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (1) ![In: Advances in Cryptology - CRYPTO 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part I, pp. 62-85, 2019, Springer, 978-3-030-26947-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
18 | Md Lutfar Rahman, Thomas Watson 0001 |
Complexity of Unordered CNF Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Bernd R. Schuh |
Sub-exponential Upper Bound for #XSAT of some CNF Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.07376, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Rocco A. Servedio, Li-Yang Tan |
Deterministic search for CNF satisfying assignments in almost polynomial time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.03588, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Bernd R. Schuh |
Sub-exponential complexity of regular linear CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.09110, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Grigoriy V. Bokov |
Complexity of the CNF-satisfiability problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.02478, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel |
BOSPHORUS: Bridging ANF and CNF Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.04580, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Bernd R. Schuh |
Exact satisfiability of linear CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 251, pp. 1-4, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Md Lutfar Rahman, Thomas Watson 0001 |
Complexity of Unordered CNF Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 29th International Symposium on Algorithms and Computation, ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan, pp. 9:1-9:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-094-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Ying Qin, Xiao Yang Shen, Zhen Yue Du |
Privacy-Preserving SAT Solving Based on Projection-Equivalence CNF Obfuscation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSS ![In: Cyberspace Safety and Security - 10th International Symposium, CSS 2018, Amalfi, Italy, October 29-31, 2018, Proceedings, pp. 224-239, 2018, Springer, 978-3-030-01688-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Ying Qin, Yan Ding, Yusong Tan, Qingbo Wu 0003 |
Solution Space Adjustable CNF Obfuscation for Privacy-Preserving SAT Solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA/IUCC/BDCloud/SocialCom/SustainCom ![In: IEEE International Conference on Parallel & Distributed Processing with Applications, Ubiquitous Computing & Communications, Big Data & Cloud Computing, Social Computing & Networking, Sustainable Computing & Communications, ISPA/IUCC/BDCloud/SocialCom/SustainCom 2018, Melbourne, Australia, December 11-13, 2018, pp. 1-8, 2018, IEEE, 978-1-7281-1141-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Yakoub Salhi |
A Method for Generating all the Prime Implicants of Binary CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2018, Fort Lauderdale, Florida, USA, January 3-5, 2018., 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
18 | Marco A. López Medina, José Raymundo Marcial-Romero, Guillermo De Ita Luna, Yolanda Moyao |
A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCPR ![In: Pattern Recognition - 10th Mexican Conference, MCPR 2018, Puebla, Mexico, June 27-30, 2018, Proceedings, pp. 72-81, 2018, Springer, 978-3-319-92197-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
18 | Ronald de Haan, Iyad A. Kanj, Stefan Szeider |
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 18(3), pp. 21:1-21:46, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | David Mitchell |
Resolution and Clause-Learning with Restarts for Signed CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 4(7), 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Benjamin Doerr, Frank Neumann 0001, Andrew M. Sutton |
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 78(2), pp. 561-586, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Louay Bazzi, Nagi Nahas |
Small-Bias is Not Enough to Hit Read-Once CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 60(2), pp. 324-345, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Carlos Barrón-Romero |
The fast parallel algorithm for CNF SAT without algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.04777, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Belal Qasemi |
A new algorithm for Solving 3-CNF-SAT problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.01396, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Petr Kucera, Petr Savický, Vojtech Vorel |
A lower bound on CNF encodings of the at-most-one constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.08934, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Bernd R. Schuh |
XSAT of Exact Linear CNF Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1711.07474, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi |
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1710.06378, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi |
Combining the k-CNF and XOR Phase-Transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.08392, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Kunho Kim, Athar Sefid, C. Lee Giles |
Scaling Author Name Disambiguation with CNF Blocking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1709.09657, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Maxim Buzdalov 0001, Benjamin Doerr |
Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.04366, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Geoff Sutcliffe |
The TPTP Problem Library and Associated Infrastructure - From CNF to TH0, TPTP v6.4.0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 59(4), pp. 483-502, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|