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
8
views
2
references
 Top references
cited by
12
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      2,478
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Orthogonal Polynomials and Special Functions 

      Counting problems in bounded arithmetic

      other
      Author(s): ,
      Publication date (Online):
      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 references2

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

          ∑11-Formulae on finite structures

          M. Ajtai (1983)
          Article 0 comments Cited 41 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Conference Proceedings: not found

            Parity, circuits, and the polynomial-time hierarchy

            Merrick Furst, James Saxe, Michael Sipser (1981)
            Article 0 comments Cited 6 times – based on 0 reviews
              Bookmark
              All references

              Author and book information

              Book Chapter
              Publication date (Print): 1985
              Publication date (Online): September 16 2006
              Pages: 317-340
              DOI: 10.1007/BFb0075316
              SO-VID: 24facf79-cd3b-483f-a940-93dce78607bd
              History

              Data availability:

              Comments

              Comment on this book

              Book chapters

              Similar content2,478

              See all similar

              Cited by12

              See all cited by