Subclasses of quantified boolean formulas-Reference-Cited by-同舟云学术

Subclasses of quantified boolean formulas

Published:1991 Issue: Volume: Page:145-155
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Flögel Andreas,Karpinski Marek,Büning Hans Kleine

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-54487-9_57

Reference8 articles.

1. S. O. Aanderaa, E. Börger: The Horn complexity of Boolean functions and Cook's problem, Proc. 5th Scand.Logic Symp. (Eds.B.Mayoh, F.Jensen), 1979, 231–256

2. B. Aspvall, M. F. Plass and R.E. Tarjan: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas, Information Processing Letters, Volume 8, number 3, 1978, 121–123

3. W. F. Dowling and J. H. Gallier: Linear-Time Algorithms For Testing The Satisfiability Of Propositional Horn Formulae, J. of Logic Programming, 1984, 267–284

4. M. R. Garey and D. S: Johnson: Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freemann and Co., New York, 1979

5. A. Haken: The intractability of resolution, Theoret. Comput. Sci. 39, 1985, 297–308

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact location of the phase transition for random (1,2)-QSAT;RAIRO - Theoretical Informatics and Applications;2015-01

2. Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits;Lecture Notes in Computer Science;2009

3. (1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms;Lecture Notes in Computer Science;2009

4. New Results on the Phase Transition for Random Quantified Boolean Formulas;Theory and Applications of Satisfiability Testing – SAT 2008;2008