On the CNF-complexity of bipartite graphs containing no $K_{2,2}$'s

Nets Hawk Katz

Type: Preprint

Publication Date: 2012-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1206.6068

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	FPTAS for Counting Monotone CNF	2014	Jing‐Cheng Liu Pinyan Lu
+	An Approximation Algorithm for #k-SAT	2011	Marc Thurley
+	k-independência em prismas complementares é NP-completo	2022	Otávio S. Mortosa Márcia R. Cappelle E. M. M. Coelho
+	On the Exact Complexity of Evaluating Quantified k -CNF	2012	Chris Calabro Russell Impagliazzo Ramamohan Paturi
+	A Linear Time Algorithm for Solving #2SAT on Cactus Formulas	2017	Marco A. López J. Raymundo Marcial‐Romero Guillermo De Ita Luna Héctor A. Montes-Venegas R. Alejo
+	The Problem of 19(k)	1973	Robert S. Cohen
+	FPTAS for Counting Monotone CNF	2013	Jing‐Cheng Liu Pinyan Lu
+	A NOTE ON THE 3_REGULAR SUBGRAPH PROBLEM	1995	Yu Lu
+	A Vertex Variant of the Kleitman-West Problem	1997	Beatrice List
+	An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas	2008	Dominik Scheder Philipp Zumstein
+	Note on the 3-graph counting lemma	2007	Brendan Nagle Vojtěch Rödl Mathias Schacht
+	Bounds for variables with few occurrences in conjunctive normal forms	2014	Oliver Kullmann Xishun Zhao
+ PDF Chat	On the graph condition regarding the $$F$$ F -inverse cover problem	2015	Nóra Szakács
+	A-1-7 On the Bipartite Dense Subgraph Problem	2014	Satoshi Tayu Dai Ito Shuichi Ueno
+	Coloration d'hypergraphes et clique-coloration	2006	David Défossez
+ PDF Chat	Constraint Satisfaction Problems in Clausal Form II: Minimal Unsatisfiability and Conflict Structure	2011	Oliver Kullmann
+	Unsatisfiable (k,(4*2^k/k))-CNF formulas	2008	Heidi Gebauer
+ PDF Chat	Known Algorithms for Edge Clique Cover are Probably Optimal	2016	Marek Cygan Marcin Pilipczuk Michał Pilipczuk
+	A Density Version of the Corradi-Hajnal Theorem	2014	Dieter Rautenbach Bruce Reed
+	On the time complexity of algorithms related to Boyce-Codd normal form	1993	János Demetrovics V. D. Thi

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors