Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
127 | Robert Cowen |
2-CNFS and Logical Embeddings. |
Stud Logica |
2009 |
DBLP DOI BibTeX RDF |
2-cnfs, 3-cnfs, logical embeddings |
109 | Fabian Breg, Constantine D. Polychronopoulos |
Computational network federations: a middleware architecture for network-based computing. |
IEEE J. Sel. Areas Commun. |
2005 |
DBLP DOI BibTeX RDF |
|
61 | Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi |
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. |
CCC |
2003 |
DBLP DOI BibTeX RDF |
|
61 | Takashi Horiyama, Toshihide Ibaraki |
Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
55 | Ehsan Amiri, Evgeny S. Skvortsov |
Pushing Random Walk Beyond Golden Ratio. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Mark Chavira, Adnan Darwiche |
Encoding CNFs to Empower Component Analysis. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Michael Alekhnovich |
Lower bounds for k-DNF resolution on random 3-CNFs. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
random 3CNF, res(k), resolution |
36 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution. |
CCC |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Svyatoslav Gryaznov, Navid Talebanfard |
Bounded Depth Frege Lower Bounds for Random 3-CNFs via Deterministic Restrictions. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Paul Veitch, Adam Broadbent, Arsham Farshad |
Comparison of Virtual Machines and Bare Metal for CNFs at Resource-Constrained Network Edge. |
NetSoft |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Menuka Perera Jayasuriya Kuranage, Elisabeth Hanser, Loutfi Nuaymi, Ahmed Bouabdallah, Philippe Bertin, Anwer Al-Dulaimi |
AI-assisted proactive scaling solution for CNFs deployed in Kubernetes. |
CloudNet |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Abdullah Bittar, Ziqiang Wang, Changcheng Huang |
Service Function Chaining Implementation using VNFs and CNFs. |
IC2E |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere |
Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes. |
J. ACM |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Md Lutfar Rahman, Thomas Watson 0001 |
Erdős-Selfridge Theorem for Nonmonotone CNFs. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
The splitting power of branching programs of bounded repetition and CNFs of bounded width. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
25 | Marcel Wild |
Compression with Wildcards: From CNFs to Orthogonal DNFs by Imposing the Clauses One-by-One. |
Comput. J. |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Jorge Baranda, Luca Vettori, Josep Mangues-Bafalluy, Ricardo Martinez 0001, Engin Zeydan |
Demo: Automated Multi-Site E2E Orchestration of Hybrid Network Services Mixing PNF, VNF and CNFs. |
ISCC |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Md Lutfar Rahman, Thomas Watson 0001 |
Erdős-Selfridge Theorem for Nonmonotone CNFs. |
SWAT |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Igor Razgon |
Classification of OBDD size for monotone 2-CNFs. |
Electron. Colloquium Comput. Complex. |
2021 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
Classification of OBDD size for monotone 2-CNFs. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
25 | Jorge Baranda, Josep Mangues-Bafalluy, Luca Vettori, Ricardo Martínez 0001, Engin Zeydan |
Deploying Hybrid Network Services: Mixing VNFs and CNFs in Multi-site Infrastructures. |
SECON |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Adrián Pino, Pouria Sayyad Khodashenas, Xavier Hesselbach, Estefanía Coronado, Shuaib Siddiqui |
Validation and Benchmarking of CNFs in OSM for pure Cloud Native applications in 5G and beyond. |
ICCCN |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Igor Razgon |
Classification of OBDD Size for Monotone 2-CNFs. |
IPEC |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Hoda Abbasizanjani, Oliver Kullmann |
Classification of minimally unsatisfiable 2-CNFs. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
25 | Vaibhav Karve, Anil N. Hirani |
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs. |
Discret. Appl. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Pol Alemany, Ricard Vilalta, Felipe Vicens, Ignacio Domínguez Gómez, Ramon Casellas, Ricardo Martínez 0001, Sonia Castro, Josep Martrat, Raul Muñoz 0001 |
Hybrid Network Slicing: Composing Network Slices based on VNFs, CNFs Network Services. |
NetSoft |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Vaibhav Karve, Anil N. Hirani |
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
25 | Armin Biere, Marijn Heule |
The Effect of Scrambling CNFs. |
POS@SAT |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere |
Random CNFs are Hard for Cutting Planes. |
Electron. Colloquium Comput. Complex. |
2017 |
DBLP BibTeX RDF |
|
25 | Simone Bova, Friedrich Slivovsky |
On Compiling Structured CNFs to OBDDs. |
Theory Comput. Syst. |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Igor Razgon |
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth. |
Theory Comput. Syst. |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere |
Random CNFs are Hard for Cutting Planes. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
25 | Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy 0001, Paul Wollan |
Space proof complexity for random 3-CNFs. |
Inf. Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere |
Random Θ(log n)-CNFs Are Hard for Cutting Planes. |
FOCS |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Ilario Bonacina, Navid Talebanfard |
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis. |
Inf. Process. Lett. |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Igor Razgon |
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. |
Algorithmica |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Oded Lachish, Igor Razgon |
Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
Two types of branching programs with bounded repetition that cannot efficiently compute monotone 3-CNFs. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
25 | Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy 0001, Paul Wollan |
Space proof complexity for random 3-CNFs. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
25 | Simone Bova, Friedrich Slivovsky |
On Compiling Structured CNFs to OBDDs. |
CSR |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
On Compiling CNFs into Structured Deterministic DNNFs. |
SAT |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan |
Space proof complexity for random 3-CNFs via a (2-ε)-Hall's Theorem. |
Electron. Colloquium Comput. Complex. |
2014 |
DBLP BibTeX RDF |
|
25 | Simone Bova, Friedrich Slivovsky |
On Compiling Structured CNFs to OBDDs. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
25 | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
Expander CNFs have Exponential DNNF Size. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
On the read-once property of branching programs and CNFs of bounded treewidth. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
No small nondeterministic read-once branching programs for CNFs of bounded treewidth. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
25 | Ilario Bonacina, Nicola Galesi, Tony Huynh, Paul Wollan |
Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. |
CoRR |
2014 |
DBLP BibTeX RDF |
|
25 | Zvika Brakerski, Guy N. Rothblum |
Black-box obfuscation for d-CNFs. |
ITCS |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Umut Oztok, Adnan Darwiche |
CV-width: A New Complexity Parameter for CNFs. |
ECAI |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Igor Razgon |
On OBDDs for CNFs of Bounded Treewidth. |
KR |
2014 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth. |
IPEC |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Luke Friedman |
A Framework for Proving Proof Complexity Lower Bounds on Random CNFs Using Encoding Techniques. |
Electron. Colloquium Comput. Complex. |
2013 |
DBLP BibTeX RDF |
|
25 | Daniel M. Kane, Osamu Watanabe 0001 |
A Short Implicant of CNFs with Relatively Many Satisfying Assignments. |
Electron. Colloquium Comput. Complex. |
2013 |
DBLP BibTeX RDF |
|
25 | Igor Razgon |
On OBDDs for CNFs of bounded treewidth. |
CoRR |
2013 |
DBLP BibTeX RDF |
|
25 | Zvika Brakerski, Guy N. Rothblum |
Black-Box Obfuscation for d-CNFs. |
IACR Cryptol. ePrint Arch. |
2013 |
DBLP BibTeX RDF |
|
25 | Hasina F. Huq, E. M. Piñon, M. Braden, J. Acuña |
Characterization of carbon nanofibers (CNFs) for glucose based biosensor application. |
MWSCAS |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Robert Cowen |
A Method for Constructing Minimally Unsatisfiable CNFs. |
CoRR |
2012 |
DBLP BibTeX RDF |
|
25 | Michael Alekhnovich |
Lower Bounds for k-DNF Resolution on Random 3-CNFs. |
Comput. Complex. |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Marco Carpentieri |
On robustness of permutations sequencing operators: Solving satisfiability of random 3 - CNFs by simple crossover. |
IEEE Congress on Evolutionary Computation |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Endre Boros, Ondrej Cepek, Alexander Kogan, Petr Kucera |
A subclass of Horn CNFs optimally compressible in polynomial time. |
Ann. Math. Artif. Intell. |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Massimo Lauria |
Random CNFs require spacious Polynomial Calculus refutations. |
Electron. Colloquium Comput. Complex. |
2009 |
DBLP BibTeX RDF |
|
25 | Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi |
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Dominik Scheder |
Unsatisfiable Linear k-CNFs Exist, for every k |
CoRR |
2007 |
DBLP BibTeX RDF |
|
25 | Mikhail Alekhnovich, Eli Ben-Sasson |
Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Takashi Horiyama, Toshihide Ibaraki |
Translation among CNFs, characteristic models and ordered binary decision diagrams. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Eugene Goldberg |
Proving Unsatisfiability of CNFs Locally. |
J. Autom. Reason. |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Eugene Goldberg |
Proving unsatisfiability of CNFs locally. |
Electron. Notes Discret. Math. |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Endre Boros |
Maximum Renamable Horn sub-CNFs. |
Discret. Appl. Math. |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Troy Lee, Adi Shraibman |
Disjointness is Hard in the Multiparty Number-on-the-Forehead Model. |
Comput. Complex. |
2009 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
18 | Amin Coja-Oghlan, Uriel Feige, Alan M. Frieze, Michael Krivelevich, Dan Vilenchik |
On smoothed k-CNF formulas and the Walksat algorithm. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Endre Boros, Kazuhisa Makino |
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem. |
ICALP (1) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Patrick Traxler |
Variable Influences in Conjunctive Normal Forms. |
SAT |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Stefan S. Dantchev, Barnaby Martin |
Cutting Planes and the Parameter Cutwidth. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Rolf Drechsler, Stephan Eggersglüß, Görschwin Fey, Andreas Glowatz, Friedrich Hapke, Jürgen Schlöffel, Daniel Tille |
On Acceleration of SAT-Based ATPG for Industrial Designs. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Troy Lee, Adi Shraibman |
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model. |
CCC |
2008 |
DBLP DOI BibTeX RDF |
multiparty communication complexity, disjointness, lower bounds |
18 | Russell Impagliazzo, Nathan Segerlind |
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations. |
ACM Trans. Comput. Log. |
2006 |
DBLP DOI BibTeX RDF |
Modular counting axioms, Nullstellensatz refutations, propositional proof complexity |
18 | Andrei A. Bulatov, Evgeny S. Skvortsov |
Efficiency of Local Search. |
SAT |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Paul Beame, Toniann Pitassi, Nathan Segerlind |
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Beate Bollig |
Property Testing and the Branching Program Size of Boolean Functions. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Martin Fränzle, Christian Herde |
Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems. |
LPAR |
2003 |
DBLP DOI BibTeX RDF |
non-clausal propositional logic, zero-one linear constraint systems, Satisfiability, proof search, acceleration techniques |
18 | Gilles Dequen, Olivier Dubois 0002 |
kcnfs: An Efficient Solver for Random k-SAT Formulae. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Evguenii I. Goldberg, Yakov Novikov |
BerkMin: A Fast and Robust Sat-Solver. |
DATE |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo |
A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Michael Alekhnovich, Alexander A. Razborov |
Satisfiability, Branch-Width and Tseitin Tautologies. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Eiter, Georg Gottlob, Kazuhisa Makino |
New results on monotone dualization and generating hypergraph transversals. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
combinatorial enumeration, hypergraph acyclicity, limited nondeterminism, output-polynomial algorithms, transversal computation, treewidth, dualization |
18 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
On the Difference of Horn Theories. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Disjunctions of Horn Theories and Their Cores. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Ramamohan Paturi, Pavel Pudlák, Francis Zane |
Satisfiability Coding Lemma. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
satisfying assignments, satisfying assignment, Satisfiability Coding Lemma, computability, randomized algorithm, satisfiability, deterministic algorithm, conjunctive normal form, Boolean formulae |
18 | Xiaorong Huang |
Translating Machine-Generated Resolution Proofs into ND-Proofs at the Assertion Level. |
PRICAI |
1996 |
DBLP DOI BibTeX RDF |
|
18 | Christoph Meinel, Anna Slobodová |
On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|