skip to content
Structure in complexity theory : proceedings of the conference held at the Univ. of California, Berkeley, California, June 2-5, 1986 Preview this item
ClosePreview this item
Checking...

Structure in complexity theory : proceedings of the conference held at the Univ. of California, Berkeley, California, June 2-5, 1986

Author: Alan L Selman; University of California Berkeley; Structure in Complexity Theory Conference. <1, 1986, Berkeley, Calif.>.
Publisher: Berlin ; Heidelberg : Springer, 1986.
Series: Lecture notes in computer science, 223.
Edition/Format:   Print book : Conference publication : EnglishView all editions and formats
Publication:Structure in Complexity Theory.
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Conference papers and proceedings
Kongress
Congresses
Material Type: Conference publication, Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Alan L Selman; University of California Berkeley; Structure in Complexity Theory Conference. <1, 1986, Berkeley, Calif.>.
ISBN: 3540164863 9783540164869 0387164863 9780387164861
OCLC Number: 310699425
In: Selman, Alan L
Description: VI, 400 Seiten : Diagramme.
Contents: The complexity of sparse sets in P.- Isomorphisms and 1-L reductions.- Randomness, relativizations, and polynomial reducibilities.- On non-uniform polynomial space.- One-way functions and circuit complexity.- Relativized alternation.- The polynomial hierarchy and intuitionistic Bounded Arithmetic.- With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy.- The boolean hierarchy: Hardware over NP.- Exponential time and bounded arithmetic.- Probabilistic game automata.- Two lower bound arguments with "inaccessible" numbers.- Resource-bounded Kolmogorov complexity of hard languages.- A note on one-way functions and polynomial time isomorphisms.- What is a hard instance of a computational problem?.- The complexity of optimization problems.- The power of the queue.- A depth-size tradeoff for boolean circuits with unbounded fan-in.- An optimal lower bound for turing machines with one work tape and a two-way input tape.- Separation results for bounded alternation.- Parallel computation with threshold functions.- The topology of provability in complexity theory.- Optimal approximations of complete sets.- Expanders, randomness, or time versus space.- Diagonalisation methods in a polynomial setting.- Bounded oracles and complexity classes inside linear space.- Parallel computation and the NC hierarchy relativized.- Probabilistic quantifiers, adversaries, and complexity classes : An overview.
Series Title: Lecture notes in computer science, 223.
Responsibility: ed. by Alan L. Selman.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/310699425> # Structure in complexity theory : proceedings of the conference held at the Univ. of California, Berkeley, California, June 2-5, 1986
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "310699425" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/gw> ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/807525666#Place/heidelberg> ; # Heidelberg
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/807525666#Place/berlin> ; # Berlin
    schema:about <http://dewey.info/class/511/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/807525666#Topic/komplexitatstheorie> ; # Komplexitätstheorie
    schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
    schema:about <http://experiment.worldcat.org/entity/work/data/807525666#Topic/computational_complexity> ; # Computational complexity
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/807525666#Organization/university_of_california_berkeley> ; # University of California Berkeley
    schema:contributor <http://experiment.worldcat.org/entity/work/data/807525666#Organization/structure_in_complexity_theory_conference_1_1986_berkeley_calif> ; # Structure in Complexity Theory Conference. <1, 1986, Berkeley, Calif.>.
    schema:datePublished "1986" ;
    schema:editor <http://viaf.org/viaf/59169347> ; # Alan L. Selman
    schema:exampleOfWork <http://worldcat.org/entity/work/id/807525666> ;
    schema:genre "Conference publication"@en ;
    schema:genre "Kongress" ;
    schema:genre "Conference papers and proceedings" ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/807525666#Series/lecture_notes_in_computer_science> ; # Lecture notes in computer science ;
    schema:name "Structure in complexity theory : proceedings of the conference held at the Univ. of California, Berkeley, California, June 2-5, 1986" ;
    schema:productID "310699425" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/310699425#PublicationEvent/berlin_heidelberg_springer_1986> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/807525666#Agent/springer> ; # Springer
    schema:url <http://swbplus.bsz-bw.de/bsz012153451cov.htm> ;
    schema:workExample <http://worldcat.org/isbn/9780387164861> ;
    schema:workExample <http://worldcat.org/isbn/9783540164869> ;
    umbel:isLike <http://d-nb.info/860511634> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/310699425> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/807525666#Organization/structure_in_complexity_theory_conference_1_1986_berkeley_calif> # Structure in Complexity Theory Conference. <1, 1986, Berkeley, Calif.>.
    a schema:Organization ;
    schema:name "Structure in Complexity Theory Conference. <1, 1986, Berkeley, Calif.>." ;
    .

<http://experiment.worldcat.org/entity/work/data/807525666#Organization/university_of_california_berkeley> # University of California Berkeley
    a schema:Organization ;
    schema:name "University of California Berkeley" ;
    .

<http://experiment.worldcat.org/entity/work/data/807525666#Series/lecture_notes_in_computer_science> # Lecture notes in computer science ;
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/310699425> ; # Structure in complexity theory : proceedings of the conference held at the Univ. of California, Berkeley, California, June 2-5, 1986
    schema:name "Lecture notes in computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/807525666#Topic/komplexitatstheorie> # Komplexitätstheorie
    a schema:Intangible ;
    schema:name "Komplexitätstheorie" ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
    schema:name "Computational complexity" ;
    .

<http://viaf.org/viaf/59169347> # Alan L. Selman
    a schema:Person ;
    schema:familyName "Selman" ;
    schema:givenName "Alan L." ;
    schema:name "Alan L. Selman" ;
    .

<http://worldcat.org/isbn/9780387164861>
    a schema:ProductModel ;
    schema:isbn "0387164863" ;
    schema:isbn "9780387164861" ;
    .

<http://worldcat.org/isbn/9783540164869>
    a schema:ProductModel ;
    schema:isbn "3540164863" ;
    schema:isbn "9783540164869" ;
    .

<http://www.worldcat.org/title/-/oclc/310699425>
    a genont:InformationResource, genont:ContentTypeGenericResource ;
    schema:about <http://www.worldcat.org/oclc/310699425> ; # Structure in complexity theory : proceedings of the conference held at the Univ. of California, Berkeley, California, June 2-5, 1986
    schema:dateModified "2018-12-08" ;
    void:inDataset <http://purl.oclc.org/dataset/WorldCat> ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.