default search action
Search dblp for Publications
export results for "toc:db/conf/coco/coco91.bht:"
@inproceedings{DBLP:conf/coco/AllenderHOW91, author = {Eric Allender and Lane A. Hemachandra and Mitsunori Ogiwara and Osamu Watanabe}, title = {Relating Equivalence and Reducibility to Sparse Sets}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {220--229}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160264}, doi = {10.1109/SCT.1991.160264}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/AllenderHOW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BabaiN91, author = {L{\'{a}}szl{\'{o}} Babai and Noam Nisan}, title = {{BPP} has Subexponential Time Simulation unless {EXPTIME} has Pubishable Proofs}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {213--219}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160263}, doi = {10.1109/SCT.1991.160263}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BabaiN91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Balcazar91, author = {Jos{\'{e}} L. Balc{\'{a}}zar}, title = {Adaptive Logspace and Depth-Bounded Reducibilities}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {240--254}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160267}, doi = {10.1109/SCT.1991.160267}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Balcazar91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BarringtonS91, author = {David A. Mix Barrington and Howard Straubing}, title = {Superlinear Lower Bounds for Bounded-Width Branching Programs}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {305--313}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160274}, doi = {10.1109/SCT.1991.160274}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BarringtonS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BeigelRS91, author = {Richard Beigel and Nick Reingold and Daniel A. Spielman}, title = {The Perceptron Strikes Back}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {286--291}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160270}, doi = {10.1109/SCT.1991.160270}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BeigelRS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BellantoniPU91, author = {Stephen J. Bellantoni and Toniann Pitassi and Alasdair Urquhart}, title = {Approximation and Small Depth Frege Proofs}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {367--390}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160281}, doi = {10.1109/SCT.1991.160281}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BellantoniPU91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/BovetCS91, author = {Daniel P. Bovet and Pierluigi Crescenzi and Riccardo Silvestri}, title = {Complexity Classes and Sparse Oracles}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {102--108}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160248}, doi = {10.1109/SCT.1991.160248}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/BovetCS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/CaiCL91, author = {Jin{-}yi Cai and Anne Condon and Richard J. Lipton}, title = {{PSPACE} Is Provable By Two Provers In One Round}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {110--115}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160250}, doi = {10.1109/SCT.1991.160250}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/CaiCL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/ChangKR91, author = {Richard Chang and Jim Kadin and Pankaj Rohatgi}, title = {Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized Reductions}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {255--269}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160268}, doi = {10.1109/SCT.1991.160268}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/ChangKR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Edmonds91, author = {Jeff Edmonds}, title = {Lower Bounds with Smaller Domain Size On Concurrent Write Parallel Machines}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {322--331}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160276}, doi = {10.1109/SCT.1991.160276}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Edmonds91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Feige91, author = {Uriel Feige}, title = {On the Success Probability of the Two Provers in One-Round Proof Systems}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {116--123}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160251}, doi = {10.1109/SCT.1991.160251}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Feige91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/FeigenbaumF91, author = {Joan Feigenbaum and Lance Fortnow}, title = {On the Random-Self-Reducibility of Complete Sets}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {124--132}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160252}, doi = {10.1109/SCT.1991.160252}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/FeigenbaumF91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Fenner91, author = {Stephen A. Fenner}, title = {Notions of Resource-Bounded Category and Genericity}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {196--212}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160262}, doi = {10.1109/SCT.1991.160262}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Fenner91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/FennerFK91, author = {Stephen A. Fenner and Lance Fortnow and Stuart A. Kurtz}, title = {Gap-Definable Counting Classes}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {30--42}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160241}, doi = {10.1109/SCT.1991.160241}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/FennerFK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/FortnowR91, author = {Lance Fortnow and Nick Reingold}, title = {{PP} is Closed Under Truth-Table Reductions}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {13--15}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160239}, doi = {10.1109/SCT.1991.160239}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/FortnowR91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Gasarch91, author = {William I. Gasarch}, title = {Bounded Queries in Recursion Theory: {A} Survey}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {62--78}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160245}, doi = {10.1109/SCT.1991.160245}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Gasarch91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GavaldaW91, author = {Ricard Gavald{\`{a}} and Osamu Watanabe}, title = {On the Computational Complexity of Small Descriptions}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {89--101}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160247}, doi = {10.1109/SCT.1991.160247}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GavaldaW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Gradel91, author = {Erich Gr{\"{a}}del}, title = {Capturing Complexity Classes by Fragments of Second Order Logic}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {341--352}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160279}, doi = {10.1109/SCT.1991.160279}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Gradel91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GrigniS91, author = {Michelangelo Grigni and Michael Sipser}, title = {Monotone Separation of Logspace from {NC}}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {294--298}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160272}, doi = {10.1109/SCT.1991.160272}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GrigniS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Gupta91, author = {Sanjay Gupta}, title = {The Power of Witness Reduction}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {43--59}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160242}, doi = {10.1109/SCT.1991.160242}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Gupta91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HeimanW91, author = {Rafi Heiman and Avi Wigderson}, title = {Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {172--179}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160258}, doi = {10.1109/SCT.1991.160258}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/HeimanW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/HomerL91, author = {Steven Homer and Luc Longpr{\'{e}}}, title = {On Reductions of {NP} Sets to Sparse Sets}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {79--88}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160246}, doi = {10.1109/SCT.1991.160246}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/HomerL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Immerman91, author = {Neil Immerman}, title = {DSPACE[n\({}^{\mbox{k}}\)] = VAR[k+1]}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {334--340}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160278}, doi = {10.1109/SCT.1991.160278}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Immerman91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/KarchmerRW91, author = {Mauricio Karchmer and Ran Raz and Avi Wigderson}, title = {Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {299--304}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160273}, doi = {10.1109/SCT.1991.160273}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/KarchmerRW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/KolaitisT91, author = {Phokion G. Kolaitis and Madhukar N. Thakur}, title = {Approximation Properties of {NP} Minimization Classes}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {353--366}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160280}, doi = {10.1109/SCT.1991.160280}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/KolaitisT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Krause91, author = {Matthias Krause}, title = {Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed Computing}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {314--321}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160275}, doi = {10.1109/SCT.1991.160275}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Krause91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LiV91, author = {Ming Li and Paul M. B. Vit{\'{a}}nyi}, title = {Combinatorics and Kolmogorov Complexity}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {154--163}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160256}, doi = {10.1109/SCT.1991.160256}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LiV91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Lutz91, author = {Jack H. Lutz}, title = {A Pseudorandom Oracle Characterization of {BPP}}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {190--195}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160261}, doi = {10.1109/SCT.1991.160261}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Lutz91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LutzS91, author = {Jack H. Lutz and William J. Schmidt}, title = {Errata for Circuit Size to Pseudorandom Oracles}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {392}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160284}, doi = {10.1109/SCT.1991.160284}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LutzS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Miltersen91, author = {Peter Bro Miltersen}, title = {The Complexity of Malign Ensembles}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {164--171}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160257}, doi = {10.1109/SCT.1991.160257}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Miltersen91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/OgiwaraH91, author = {Mitsunori Ogiwara and Lane A. Hemachandra}, title = {A Complexity Theory for Feasible Closure Properties}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {16--29}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160240}, doi = {10.1109/SCT.1991.160240}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/OgiwaraH91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/OgiwaraL91, author = {Mitsunori Ogiwara and Antoni Lozano}, title = {On One Query Self-Reducible Sets}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {139--151}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160254}, doi = {10.1109/SCT.1991.160254}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/OgiwaraL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ostrovsky91, author = {Rafail Ostrovsky}, title = {One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {133--138}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160253}, doi = {10.1109/SCT.1991.160253}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ostrovsky91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Santha91, author = {Miklos Santha}, title = {On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {180--187}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160259}, doi = {10.1109/SCT.1991.160259}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Santha91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/TangFL91, author = {Shouwen Tang and Bin Fu and Tian Liu}, title = {Exponential Time and Subexponential Time Sets}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {230--237}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160265}, doi = {10.1109/SCT.1991.160265}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/TangFL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Tarui91, author = {Jun Tarui}, title = {Degree Compexity of Boolean Functions and Its Applications to Realivized Separations}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {382--390}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160282}, doi = {10.1109/SCT.1991.160282}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Tarui91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/TodaO91, author = {Seinosuke Toda and Mitsunori Ogiwara}, title = {Counting Classes Are at Least as Hard as the Polynomial-Time Hierarchy}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {2--12}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160238}, doi = {10.1109/SCT.1991.160238}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/TodaO91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Vinay91, author = {V. Vinay}, title = {Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits}, booktitle = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, pages = {270--284}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://doi.org/10.1109/SCT.1991.160269}, doi = {10.1109/SCT.1991.160269}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Vinay91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/coco/1991, title = {Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30 - July 3, 1991}, publisher = {{IEEE} Computer Society}, year = {1991}, url = {https://ieeexplore.ieee.org/xpl/conhome/364/proceeding}, isbn = {0-8186-2255-5}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/1991.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.