Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
11
views
18
references
 Top references
cited by
4
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      4,182
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Advances in Cryptology — CRYPTO’ 88 : Proceedings 

      On Propositional QBF Expansions and Q-Resolution

      other
      Author(s): ,
      Publication date (Print):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references18

          • Record: found
          • Abstract: found
          • Article: not found

          The relative efficiency of propositional proof systems

          Stephen Cook, Robert A. Reckhow (1979)
          We are interested in studying the length of the shortest proof of a propositional tautology in various proof systems as a function of the length of the tautology. The smallest upper bound known for this function is exponential, no matter what the proof system. A question we would like to answer (but have not been able to) is whether this function has a polynomial bound for some proof system. (This question is motivated below.) Our results here are relative results.
          Article 0 comments Cited 71 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Conflict driven learning in a quantified Boolean Satisfiability solver

            Lintao Zhang, Sharad Malik (2002)
            Article 0 comments Cited 32 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Unified QBF certification and its applications

              Jie-Hong Jiang, Valeriy Balabanov (2012)
              Article 0 comments Cited 21 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2013
                Pages: 67-82
                DOI: 10.1007/978-3-642-39071-5_7
                SO-VID: fe823961-45f9-4e69-98e1-38a12d039071
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content4,182

                See all similar

                Cited by4

                See all cited by