Abstract
Assuming random 3-SAT formulas are hard to refute, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in that we show that approximating max bipartite clique is hard under the weaker assumption, that random 4-SAT formulas are hard to refute. On the positive side we present an efficient algorithm which finds a hidden solution in an otherwise random not-all-equal 4-SAT instance. This extends analogous results on not-all-equal 3-SAT and classical 3-SAT. The common principle underlying our results is to obtain efficiently information about discrepancy (expansion) properties of graphs naturally associated to 4-SAT instances. In case of 4-SAT (or k-SAT in general) the relationship between the structure of these graphs and that of the instance itself is weaker than in case of 3-SAT. This causes problems whose solution is the technical core of this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Feige, U., Widgerson, A., Zuckerman, D.: Derandomized Graph Products. Computational Complexity 5, 60–75 (1995)
Alon, N., Kahale, N.: A spectral technique for coloring random 3-colourable graphs. DIMACS TR 94-35 (1994)
Chen, H., Frieze, A.: Coloring bipartite hypergraphs. In: Proc. 5th IPCO 1996. LNCS, pp. 345–358. Springer, Heidelberg (1996)
Coja-Oghlan, A., Goerdt, A., Lanka, A.: Strong Refutation Heuristics for Random k-SAT. RANDOM, To appear (2004), http://www.tu-chemnitz.de/informatik/HomePages/TI/publikationen.php
Coja-Oghlan, A., Goerdt, A., Lanka, A., Schädlich, F.: Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. Theoretical Computer Science. (To appear)
Feige, U.: Relations between average case complexity and approximation complexity. In: Proc. 24th STOC, pp. 534–543 (2002)
Feige, U., Ofek, E.: Easily refutable subformulas of large random 3CNF formulas, http://www.wisdom.weizmann.ac.il/~erano/
Flaxman, A.: A spectral technique for random satisfiable 3CNF formulas. In: Proc. SoDA 2002, SIAM, Philadelphia (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability (1979)
Goerdt, A., Jurdzinski, T.: Some results on random unsatisfiable k-SAT instances and approximation algorithms applied to random structures. Combinatorics, Probability and Computing 12, 245–267 (2003)
Goerdt, A., Lanka, A.: Recognizing more random unsatisfiable 3-SAT instances efficiently. Proc. Typical Case Complexity and Phase Transitions, Satellite Workshop of Logic in Computer Science (Ottawa). To appear (2003)
Goerdt, A., Lanka, A.: The algorithmic hardness and easiness of random 4-SAT formulas. Technical report, http://www.tu-chemnitz.de/informatik/HomePages/TI/publikationen.php
Håstad, J.: Clique is Hard to Approximate within n 1 − ε. Acta Mathematica 182, 105–142 (1999)
Janson, S., Łuczak, T., Ruciński, A.: Random graphs. John Wiley and Sons, Chichester (2000)
Lubotsky, A., Phillips, R., Sarnak, P.: Ramanujan Graphs. Combinatorica 8(3), 261–277 (1988)
Peeters, R.: The maximum edge biclique problem is \({\mathcal NP}\)-complete. Research Memorandum 789, Faculty of Economics and Business Administration, Tilberg University (2000), http://econpapers.hhs.se/paper/dgrkubrem/2000789.htm
Strang, G.: Linear Algebra and its Applications. Harcourt Brace Jovanovich (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerdt, A., Lanka, A. (2004). On the Hardness and Easiness of Random 4-SAT Formulas. In: Fleischer, R., Trippen, G. (eds) Algorithms and Computation. ISAAC 2004. Lecture Notes in Computer Science, vol 3341. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30551-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-30551-4_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24131-7
Online ISBN: 978-3-540-30551-4
eBook Packages: Computer ScienceComputer Science (R0)