On converting CNF to DNF

Theoretical Computer Science

Volumn 347, Issue 1-2, 2005, Pages 325-335

  Miltersen, Peter Bro ^a   Radhakrishnan, Jaikumar ^b   Wegener, Ingo ^c  

^a AARHUS UNIVERSITY   (Denmark)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Circuit size; Conjunctive normal form; Disjunctive normal form; Switching lemma

Indexed keywords

POLYNOMIALS; SWITCHES;

CIRCUIT SIZE; SWITCHING LEMMA;

COMPUTER SCIENCE;

EID: 27844579200     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.07.029     Document Type: Article

References (18)

1. P. Beame, A switching lemma primer, Technical Report UW-CSE-95-07-01, Department of Computer Science and Engineering, University of Washington, November 1994, Available online at www.cs.washington.edu/homes/beame/.
2. B. Bollig, and I. Wegener A very simple function that requires exponential size read-once branching programs Inform. Process. Lett. 66 1998 53 57
3. V. Chvátal The tail of the hypergeometric distribution Discrete Math. 25 1979 285 287
4. n algorithm for k-SAT based on local search Theor. Comput. Sci. 289 2002 69 83
5. E. Dantsin, A. Goerdt, E.A. Hirsch, U. Schöning, Deterministic algorithms for k-SAT based on covering codes and local search, Proc. of the 27th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000, pp. 236-247.
6. E. Dantsin, A. Wolpert, Derandomization of Schuler's algorithm for SAT, Proc. of the seventh International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Computer Science, Vol. 3542, Springer, Berlin, 2004, pp. 69-75.
7. J. Håstad Almost optimal lower bounds for small depth circuits S. Micali Randomness and Computation, Advances in Computing Research Vol. 5 1989 JAI Press Greenwich 143 170
8. T. Hofmeister, U. Schöning, R. Schuler, O. Watanabe, A probabilistic 3-SAT algorithm further improved, Proceedings of STACS, Lecture Notes in Computer Science, Vol. 2285, Springer, Berlin, 2002, pp. 192-202.
9. J. Katajainen, J.N. Madsen, Performance tuning an algorithm for compressing relational tables, Proceedings of SWAT, Lecture Notes in Computer Science, Vol. 2368, Springer, Berlin, 2002, pp. 398-407.
10. P.B. Miltersen, J. Radhakrishnan, I. Wegener, On converting CNF to DNF, Proceedings of MFCS, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, 2003, pp. 612-621.
11. n steps Discrete Appl. Math. 10 1985 287 295
12. R. Paturi, P. Pudlàk, M.E. Saks, F. Zane, An improved exponential-time algorithm for k-SAT, Proceedings of the 39th IEEE Symposium on the Foundations of Computer Science, 1998, pp. 628-637.
13. W.V.O. Quine On cores and prime implicants of truth functions Amer. Math. Monthly 66 1959 755 760
14. A. Razborov, and S. Rudich Natural proofs J. Comput. System Sci. 55 1997 24 35
15. U. Schöning A probabilistic algorithm for k-SAT based on limited local search and restart Algorithmica 32 2002 615 623
16. B. Voigt, and I. Wegener Minimal polynomials for the conjunctions of functions on disjoint variables an be very simple Inform. Comput. 83 1989 65 79
17. I. Wegener, The Complexity of Boolean Functions, Wiley, New York, 1987. Freely available via http://ls2-www.cs.uni-dortmund.de/ ∼ wegener.
18. I. Wegener, Branching programs and binary decision diagrams - theory and applications, SIAM Monographs on Discrete Mathematics and Applications, 2000.