Search results for "CNF"

Hits ?▲	Authors	Title	Venue	Year	Link
18	Anastasia Sofronova, Dmitry Sokolov 0001	A Lower Bound for k-DNF Resolution on Random CNF Formulas via Expansion.	Electron. Colloquium Comput. Complex.	2022	DBLP BibTeX RDF
18	Till Tantau	On the Satisfaction Probability of k-CNF Formulas.	CoRR	2022	DBLP BibTeX RDF
18	Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin	CNF Encodings of Parity.	CoRR	2022	DBLP DOI BibTeX RDF
18	Alexander A. Sherstov	The Approximate Degree of DNF and CNF Formulas.	CoRR	2022	DBLP DOI BibTeX RDF
18	Kun He 0011, Kewen Wu 0001, Kuan Yang	Improved Bounds for Sampling Solutions of Random CNF Formulas.	CoRR	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.	IACR Cryptol. ePrint Arch.	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.	ICACT	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.	CILC	2022	DBLP BibTeX RDF
18	Gregory Emdin, Alexander S. Kulikov, Ivan Mihajlin, Nikita Slezkin	CNF Encodings of Parity.	MFCS	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.	ASIACRYPT (2)	2022	DBLP DOI BibTeX RDF
18	Stephan Gocht, Ruben Martins, Jakob Nordström, Andy Oertel	Certified CNF Translations for Pseudo-Boolean Solving.	SAT	2022	DBLP DOI BibTeX RDF
18	Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky	CNF-FSS and Its Applications.	Public Key Cryptography (1)	2022	DBLP DOI BibTeX RDF
18	Ruiwei Wang, Roland H. C. Yap	CNF Encodings of Binary Constraint Trees.	CP	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.	ASE	2022	DBLP DOI BibTeX RDF
18	Alexander A. Sherstov	The approximate degree of DNF and CNF formulas.	STOC	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.	MLIS	2022	DBLP DOI BibTeX RDF
18	Till Tantau	On the Satisfaction Probability of k-CNF Formulas.	CCC	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.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
18	Vikraman Arvind, Venkatesan Guruswami	CNF Satisfiability in a Subspace and Related Problems.	Electron. Colloquium Comput. Complex.	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.	CoRR	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.".	CoRR	2021	DBLP BibTeX RDF
18	Vikraman Arvind, Venkatesan Guruswami	CNF Satisfiability in a Subspace and Related Problems.	CoRR	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.	CoRR	2021	DBLP BibTeX RDF
18	Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky	CNF-FSS and its Applications.	IACR Cryptol. ePrint Arch.	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.	J. Log. Comput.	2021	DBLP DOI BibTeX RDF
18	Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang	Counting Solutions to Random CNF Formulas.	SIAM J. Comput.	2021	DBLP DOI BibTeX RDF
18	Steven D. Prestwich	CNF Encodings.	Handbook of Satisfiability	2021	DBLP DOI BibTeX RDF
18	Stephan Gocht, Jakob Nordström, Ruben Martins	Certifying CNF Encodings of Pseudo-Boolean Constraints (abstract).	PxTP	2021	DBLP DOI BibTeX RDF
18	Viorel Iordache, Stefan Ciobaca	Verifying the Conversion into CNF in Dafny.	WoLLIC	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.	ICTC	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.	MMBD/MLIS	2021	DBLP DOI BibTeX RDF
18	Paolo Fantozzi, Luigi Laura, Umberto Nanni, Alessandro Villa	Non-isomorphic CNF Generation.	DCAI (1)	2021	DBLP DOI BibTeX RDF
18	Arcchit Jain, Clément Gautrais, Angelika Kimmig, Luc De Raedt	Learning CNF Theories Using MDL and Predicate Invention.	IJCAI	2021	DBLP DOI BibTeX RDF
18	Vikraman Arvind, Venkatesan Guruswami	CNF Satisfiability in a Subspace and Related Problems.	IPEC	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.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	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.	IEEE Trans. Computational Imaging	2020	DBLP DOI BibTeX RDF
18	Guillaume Escamocher, Barry O'Sullivan, Steven David Prestwich	Generating Difficult CNF Instances in Unexplored Constrainedness Regions.	ACM J. Exp. Algorithmics	2020	DBLP DOI BibTeX RDF
18	Romain Wallon, Stefan Mengel	Revisiting Graph Width Measures for CNF-Encodings.	J. Artif. Intell. Res.	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.	CoRR	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.	CoRR	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.	CoRR	2020	DBLP BibTeX RDF
18	S. I. Uvarov	An Improved Generator for 3-CNF Formulas.	Autom. Remote. Control.	2020	DBLP DOI BibTeX RDF
18	Zufeng Fu, Daoyun Xu, Yongping Wang	(1, 0)-Super Solutions of (k, s)-CNF Formula.	Entropy	2020	DBLP DOI BibTeX RDF
18	Montserrat Hermo, Ana Ozaki	Exact Learning: On the Boundary between Horn and CNF.	ACM Trans. Comput. Theory	2020	DBLP DOI BibTeX RDF
18	Md Lutfar Rahman, Thomas Watson 0001	Complexity of Unordered CNF Games.	ACM Trans. Comput. Theory	2020	DBLP DOI BibTeX RDF
18	Jan Horácek, Martin Kreuzer	On conversions from CNF to ANF.	J. Symb. Comput.	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.	CAV (1)	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.	CILC	2020	DBLP BibTeX RDF
18	Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang	Counting Solutions to Random CNF Formulas.	ICALP	2020	DBLP DOI BibTeX RDF
18	Andrea Lincoln, Adam Yedidia	Faster Random k-CNF Satisfiability.	ICALP	2020	DBLP DOI BibTeX RDF
18	Giorgio Ausiello, Francesco Cristiano, Paolo Fantozzi, Luigi Laura	Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete.	ICTCS	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.	ICTAI	2020	DBLP DOI BibTeX RDF
18	Kunho Kim, Athar Sefid, C. Lee Giles	Learning CNF Blocking for Large-scale Author Name Disambiguation.	SDP@EMNLP	2020	DBLP DOI BibTeX RDF
18	Md Lutfar Rahman, Thomas Watson 0001	Tractable Unordered 3-CNF Games.	LATIN	2020	DBLP DOI BibTeX RDF
18	Petr Kucera, Petr Savický	On the size of CNF formulas with high propagation strength.	ISAIM	2020	DBLP BibTeX RDF
18	Chao Xu 0010, Jianer Chen, Jianxin Wang 0001	Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
18	Petr Kucera, Petr Savický, Vojtech Vorel	A lower bound on CNF encodings of the at-most-one constraint.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
18	Md Lutfar Rahman, Thomas Watson 0001	Tractable Unordered 3-CNF Games.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
18	Michal Karpinski	CNF Encodings of Cardinality Constraints Based on Comparator Networks.	CoRR	2019	DBLP BibTeX RDF
18	Andreas Galanis, Leslie Ann Goldberg, Heng Guo 0001, Kuan Yang	Counting solutions to random CNF formulas.	CoRR	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.	CoRR	2019	DBLP BibTeX RDF
18	Stefan Mengel, Romain Wallon	Revisiting Graph Width Measures for CNF-Encodings.	CoRR	2019	DBLP BibTeX RDF
18	Andrea Calì, Igor Razgon	Regular resolution for CNF of bounded incidence treewidth with few long clauses.	CoRR	2019	DBLP BibTeX RDF
18	Andrea Lincoln, Adam Yedidia	Faster Random k-CNF Satisfiability.	CoRR	2019	DBLP BibTeX RDF
18	Huang Zhang, Fangguo Zhang, Rong Cheng, Haibo Tian	Efficient obfuscation for CNF circuits and applications in cloud computing.	Soft Comput.	2019	DBLP DOI BibTeX RDF
18	Rotem Tsabary	Fully Secure Attribute-Based Encryption for t-CNF from LWE.	IACR Cryptol. ePrint Arch.	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.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
18	Aolong Zha, Miyuki Koshimura, Hiroshi Fujita 0002	N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT.	Constraints An Int. J.	2019	DBLP DOI BibTeX RDF
18	Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel	Bosphorus: Bridging ANF and CNF Solvers.	DATE	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.	AAAI	2019	DBLP DOI BibTeX RDF
18	Stefan Mengel, Romain Wallon	Revisiting Graph Width Measures for CNF-Encodings.	SAT	2019	DBLP DOI BibTeX RDF
18	Yakoub Salhi	On Enumerating All the Minimal Models for Particular CNF Formula Classes.	ICAART (2)	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.	IWSEC	2019	DBLP DOI BibTeX RDF
18	David E. Narváez	Formalizing CNF SAT Symmetry Breaking in PVS.	NFM	2019	DBLP DOI BibTeX RDF
18	Rotem Tsabary	Fully Secure Attribute-Based Encryption for t-CNF from LWE.	CRYPTO (1)	2019	DBLP DOI BibTeX RDF
18	Md Lutfar Rahman, Thomas Watson 0001	Complexity of Unordered CNF Games.	Electron. Colloquium Comput. Complex.	2018	DBLP BibTeX RDF
18	Bernd R. Schuh	Sub-exponential Upper Bound for #XSAT of some CNF Classes.	CoRR	2018	DBLP BibTeX RDF
18	Rocco A. Servedio, Li-Yang Tan	Deterministic search for CNF satisfying assignments in almost polynomial time.	CoRR	2018	DBLP BibTeX RDF
18	Bernd R. Schuh	Sub-exponential complexity of regular linear CNF formulas.	CoRR	2018	DBLP BibTeX RDF
18	Grigoriy V. Bokov	Complexity of the CNF-satisfiability problem.	CoRR	2018	DBLP BibTeX RDF
18	Davin Choo, Mate Soos, Kian Ming Adam Chai, Kuldeep S. Meel	BOSPHORUS: Bridging ANF and CNF Solvers.	CoRR	2018	DBLP BibTeX RDF
18	Bernd R. Schuh	Exact satisfiability of linear CNF formulas.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
18	Md Lutfar Rahman, Thomas Watson 0001	Complexity of Unordered CNF Games.	ISAAC	2018	DBLP DOI BibTeX RDF
18	Ying Qin, Xiao Yang Shen, Zhen Yue Du	Privacy-Preserving SAT Solving Based on Projection-Equivalence CNF Obfuscation.	CSS	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.	ISPA/IUCC/BDCloud/SocialCom/SustainCom	2018	DBLP DOI BibTeX RDF
18	Yakoub Salhi	A Method for Generating all the Prime Implicants of Binary CNF Formulas.	ISAIM	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.	MCPR	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.	ACM Trans. Comput. Log.	2017	DBLP DOI BibTeX RDF
18	David Mitchell	Resolution and Clause-Learning with Restarts for Signed CNF Formulas.	FLAP	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.	Algorithmica	2017	DBLP DOI BibTeX RDF
18	Louay Bazzi, Nagi Nahas	Small-Bias is Not Enough to Hit Read-Once CNF.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
18	Carlos Barrón-Romero	The fast parallel algorithm for CNF SAT without algebra.	CoRR	2017	DBLP BibTeX RDF
18	Belal Qasemi	A new algorithm for Solving 3-CNF-SAT problem.	CoRR	2017	DBLP BibTeX RDF
18	Petr Kucera, Petr Savický, Vojtech Vorel	A lower bound on CNF encodings of the at-most-one constraint.	CoRR	2017	DBLP BibTeX RDF
18	Bernd R. Schuh	XSAT of Exact Linear CNF Classes.	CoRR	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.	CoRR	2017	DBLP BibTeX RDF
18	Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi	Combining the k-CNF and XOR Phase-Transitions.	CoRR	2017	DBLP BibTeX RDF
18	Kunho Kim, Athar Sefid, C. Lee Giles	Scaling Author Name Disambiguation with CNF Blocking.	CoRR	2017	DBLP BibTeX RDF
18	Maxim Buzdalov 0001, Benjamin Doerr	Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on Random Satisfiable 3-CNF Formulas.	CoRR	2017	DBLP BibTeX RDF
18	Geoff Sutcliffe	The TPTP Problem Library and Associated Infrastructure - From CNF to TH0, TPTP v6.4.0.	J. Autom. Reason.	2017	DBLP DOI BibTeX RDF