Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "polynomial time hierarchy"
download as .bib file
@inproceedings{DBLP:conf/soda/IkenmeyerPP23,
author = {Christian Ikenmeyer and
Igor Pak and
Greta Panova},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Positivity of the symmetric group characters is as hard as the polynomial
time hierarchy},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {3573--3586},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch136},
doi = {10.1137/1.9781611977554.CH136},
timestamp = {Fri, 17 Feb 2023 09:28:57 +0100},
biburl = {https://dblp.org/rec/conf/soda/IkenmeyerPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2207-05423,
author = {Christian Ikenmeyer and
Igor Pak and
Greta Panova},
title = {Positivity of the symmetric group characters is as hard as the polynomial
time hierarchy},
journal = {CoRR},
volume = {abs/2207.05423},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2207.05423},
doi = {10.48550/ARXIV.2207.05423},
eprinttype = {arXiv},
eprint = {2207.05423},
timestamp = {Thu, 14 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2207-05423.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/BorgesP19,
author = {Nerio Borges and
Edwin Pin},
title = {Universal first-order logic is superfluous in the second level of
the polynomial-time hierarchy},
journal = {Log. J. {IGPL}},
volume = {27},
number = {6},
pages = {895--909},
year = {2019},
url = {https://doi.org/10.1093/jigpal/jzz009},
doi = {10.1093/JIGPAL/JZZ009},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igpl/BorgesP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BozzelliMMPS18,
author = {Laura Bozzelli and
Alberto Molinari and
Angelo Montanari and
Adriano Peron and
Pietro Sala},
title = {Model checking for fragments of the interval temporal logic {HS} at
the low levels of the polynomial time hierarchy},
journal = {Inf. Comput.},
volume = {262},
pages = {241--264},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.09.006},
doi = {10.1016/J.IC.2018.09.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BozzelliMMPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-04080,
author = {Ishay Haviv and
Oded Regev and
Amnon Ta{-}Shma},
title = {On the Hardness of Satisfiability with Bounded Occurrences in the
Polynomial-Time Hierarchy},
journal = {CoRR},
volume = {abs/1806.04080},
year = {2018},
url = {http://arxiv.org/abs/1806.04080},
eprinttype = {arXiv},
eprint = {1806.04080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-04080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PinB17,
author = {Edwin Pin and
Nerio Borges},
title = {A syntactic tool for proving hardness in the Second Level of the Polynomial-Time
Hierarchy},
journal = {CoRR},
volume = {abs/1707.09327},
year = {2017},
url = {http://arxiv.org/abs/1707.09327},
eprinttype = {arXiv},
eprint = {1707.09327},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PinB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DellM14,
author = {Holger Dell and
Dieter van Melkebeek},
title = {Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time
Hierarchy Collapses},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {23:1--23:27},
year = {2014},
url = {https://doi.org/10.1145/2629620},
doi = {10.1145/2629620},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DellM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/KahleO13,
author = {Reinhard Kahle and
Isabel Oitavem},
title = {Applicative theories for the polynomial hierarchy of time and its
levels},
journal = {Ann. Pure Appl. Log.},
volume = {164},
number = {6},
pages = {663--675},
year = {2013},
url = {https://doi.org/10.1016/j.apal.2012.05.006},
doi = {10.1016/J.APAL.2012.05.006},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/apal/KahleO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FrederiksenM13,
author = {S{\o}ren Kristoffer Stiil Frederiksen and
Peter Bro Miltersen},
editor = {Leizhen Cai and
Siu{-}Wing Cheng and
Tak Wah Lam},
title = {Approximating the Value of a Concurrent Reachability Game in the Polynomial
Time Hierarchy},
booktitle = {Algorithms and Computation - 24th International Symposium, {ISAAC}
2013, Hong Kong, China, December 16-18, 2013, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8283},
pages = {457--467},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45030-3\_43},
doi = {10.1007/978-3-642-45030-3\_43},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FrederiksenM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/GrossoT12,
author = {Alejandro L. Grosso and
Jos{\'{e}} M. Turull Torres},
editor = {Antje D{\"{u}}sterh{\"{o}}ft and
Meike Klettke and
Klaus{-}Dieter Schewe},
title = {{SO} {F} : {A} Semantic Restriction over Second-Order Logic and Its
Polynomial-Time Hierarchy},
booktitle = {Conceptual Modelling and Its Theoretical Foundations - Essays Dedicated
to Bernhard Thalheim on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7260},
pages = {116--135},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-28279-9\_10},
doi = {10.1007/978-3-642-28279-9\_10},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/GrossoT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aplas/Baillot11,
author = {Patrick Baillot},
editor = {Hongseok Yang},
title = {Elementary Linear Logic Revisited for Polynomial Time and an Exponential
Time Hierarchy},
booktitle = {Programming Languages and Systems - 9th Asian Symposium, {APLAS} 2011,
Kenting, Taiwan, December 5-7, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7078},
pages = {337--352},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25318-8\_25},
doi = {10.1007/978-3-642-25318-8\_25},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aplas/Baillot11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DellM10,
author = {Holger Dell and
Dieter van Melkebeek},
editor = {Leonard J. Schulman},
title = {Satisfiability allows no nontrivial sparsification unless the polynomial-time
hierarchy collapses},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {251--260},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806725},
doi = {10.1145/1806689.1806725},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DellM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MelkebeekD10,
author = {Dieter van Melkebeek and
Holger Dell},
title = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time
Hierarchy Collapses},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-038}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/038},
eprinttype = {ECCC},
eprint = {TR10-038},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MelkebeekD10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DellM09,
author = {Holger Dell and
Dieter van Melkebeek},
editor = {Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time
Hierarchy Collapses},
booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09511},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2504/},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DellM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BuenoM08,
author = {Orestes Bueno and
Prabhu Manyem},
title = {Polynomial-TimeMaximisation Classes: Syntactic Hierarchy},
journal = {Fundam. Informaticae},
volume = {84},
number = {1},
pages = {111--133},
year = {2008},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi84-1-09},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/BuenoM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdb/FerrarottiT08,
author = {Flavio Antonio Ferrarotti and
Jose Maria Turull Torres},
editor = {Klaus{-}Dieter Schewe and
Bernhard Thalheim},
title = {The Relational Polynomial-Time Hierarchy and Second-Order Logic},
booktitle = {Semantics in Data and Knowledge Bases, Third International Workshop,
{SDKB} 2008, Nantes, France, March 29, 2008, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4925},
pages = {48--76},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-88594-8\_3},
doi = {10.1007/978-3-540-88594-8\_3},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/sdb/FerrarottiT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HavivRT07,
author = {Ishay Haviv and
Oded Regev and
Amnon Ta{-}Shma},
title = {On the Hardness of Satisfiability with Bounded Occurrences in the
Polynomial-Time Hierarchy},
journal = {Theory Comput.},
volume = {3},
number = {1},
pages = {45--60},
year = {2007},
url = {https://doi.org/10.4086/toc.2007.v003a003},
doi = {10.4086/TOC.2007.V003A003},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HavivRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GaultS06,
author = {Richard Gault and
Iain A. Stewart},
title = {An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes},
journal = {Theory Comput. Syst.},
volume = {39},
number = {5},
pages = {753--783},
year = {2006},
url = {https://doi.org/10.1007/s00224-005-1230-6},
doi = {10.1007/S00224-005-1230-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GaultS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DiehlM06,
author = {Scott Diehl and
Dieter van Melkebeek},
title = {Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized
Machines},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {3},
pages = {563--594},
year = {2006},
url = {https://doi.org/10.1137/050642228},
doi = {10.1137/050642228},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DiehlM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Gutfreund06,
author = {Dan Gutfreund},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time
Hierarchy},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {386--397},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_36},
doi = {10.1007/11830924\_36},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Gutfreund06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GlasserTW06,
author = {Christian Gla{\ss}er and
Stephen D. Travers and
Klaus W. Wagner},
editor = {Oscar H. Ibarra and
Zhe Dang},
title = {Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy},
booktitle = {Developments in Language Theory, 10th International Conference, {DLT}
2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4036},
pages = {408--419},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11779148\_37},
doi = {10.1007/11779148\_37},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/GlasserTW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Umans06,
author = {Christopher Umans},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Angsheng Li},
title = {Optimization Problems in the Polynomial-Time Hierarchy},
booktitle = {Theory and Applications of Models of Computation, Third International
Conference, {TAMC} 2006, Beijing, China, May 15-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3959},
pages = {345--355},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11750321\_33},
doi = {10.1007/11750321\_33},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Umans06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DiehlM06,
author = {Scott Diehl and
Dieter van Melkebeek},
editor = {Matthias Krause and
Pavel Pudl{\'{a}}k and
R{\"{u}}diger Reischuk and
Dieter van Melkebeek},
title = {Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized
Machines},
booktitle = {Complexity of Boolean Functions, 12.03. - 17.03.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06111},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2006/605},
timestamp = {Thu, 10 Jun 2021 13:02:07 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DiehlM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Manyem06,
author = {Prabhu Manyem},
title = {Polynomial-Time Maximisation Classes: Syntactic Hierarchy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-082}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-082/index.html},
eprinttype = {ECCC},
eprint = {TR06-082},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Manyem06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DiehlM05,
author = {Scott Diehl and
Dieter van Melkebeek},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized
Machines},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {982--993},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_79},
doi = {10.1007/11523468\_79},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DiehlM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CaiW04,
author = {Jin{-}yi Cai and
Osamu Watanabe},
title = {On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {4},
pages = {984--1009},
year = {2004},
url = {https://doi.org/10.1137/S0097539703422716},
doi = {10.1137/S0097539703422716},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/CaiW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FortnowS04,
author = {Lance Fortnow and
Rahul Santhanam},
title = {Hierarchy Theorems for Probabilistic Polynomial Time},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {316--324},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.33},
doi = {10.1109/FOCS.2004.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FortnowS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CaiW03,
author = {Jin{-}yi Cai and
Osamu Watanabe},
editor = {Tandy J. Warnow and
Binhai Zhu},
title = {On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy:
Positive and Negative Results},
booktitle = {Computing and Combinatorics, 9th Annual International Conference,
{COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2697},
pages = {202--211},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45071-8\_22},
doi = {10.1007/3-540-45071-8\_22},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/CaiW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KlivansM02,
author = {Adam R. Klivans and
Dieter van Melkebeek},
title = {Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time
Hierarchy Collapses},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {5},
pages = {1501--1526},
year = {2002},
url = {https://doi.org/10.1137/S0097539700389652},
doi = {10.1137/S0097539700389652},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KlivansM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Etessami02,
author = {Kousha Etessami},
editor = {Lubos Brim and
Petr Jancar and
Mojm{\'{\i}}r Kret{\'{\i}}nsk{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {A Hierarchy of Polynomial-Time Computable Simulations for Automata},
booktitle = {{CONCUR} 2002 - Concurrency Theory, 13th International Conference,
Brno, Czech Republic, August 20-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2421},
pages = {131--144},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45694-5\_10},
doi = {10.1007/3-540-45694-5\_10},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/concur/Etessami02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Cai99,
author = {Jin{-}yi Cai},
title = {A Classification of the Probabilistic Polynomial Time Hierarchy Under
Fault Tolerant Access to Oracle Classes},
journal = {Inf. Process. Lett.},
volume = {69},
number = {4},
pages = {167--174},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00011-3},
doi = {10.1016/S0020-0190(99)00011-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Cai99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaiNS99,
author = {Jin{-}yi Cai and
Ajay Nerurkar and
D. Sivakumar},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial
Time},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {726--735},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301444},
doi = {10.1145/301250.301444},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CaiNS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KlivansM99,
author = {Adam R. Klivans and
Dieter van Melkebeek},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time
Hierarchy Collapses},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {659--667},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301428},
doi = {10.1145/301250.301428},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KlivansM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/BaierW98,
author = {Herbert Baier and
Klaus W. Wagner},
title = {The Analytic Polynomial Time Hierarchy},
journal = {Math. Log. Q.},
volume = {44},
pages = {529--544},
year = {1998},
url = {https://doi.org/10.1002/malq.19980440412},
doi = {10.1002/MALQ.19980440412},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/BaierW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BaierW98,
author = {Herbert Baier and
Klaus W. Wagner},
title = {Bounding Queries in the Analytic Polynomial-Time Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {207},
number = {1},
pages = {89--104},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(98)00057-7},
doi = {10.1016/S0304-3975(98)00057-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BaierW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-075,
author = {Adam R. Klivans and
Dieter van Melkebeek},
title = {Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time
Hierarchy Collapses},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-075}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-075/index.html},
eprinttype = {ECCC},
eprint = {TR98-075},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlp/Bonner97,
author = {Anthony J. Bonner},
title = {Intuitionistic Deductive Databases and the Polynomial Time Hierarchy},
journal = {J. Log. Program.},
volume = {33},
number = {1},
pages = {1--47},
year = {1997},
url = {https://doi.org/10.1016/S0743-1066(96)00107-0},
doi = {10.1016/S0743-1066(96)00107-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jlp/Bonner97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Canetti96,
author = {Ran Canetti},
title = {More on {BPP} and the Polynomial-Time Hierarchy},
journal = {Inf. Process. Lett.},
volume = {57},
number = {5},
pages = {237--241},
year = {1996},
url = {https://doi.org/10.1016/0020-0190(96)00016-6},
doi = {10.1016/0020-0190(96)00016-6},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Canetti96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Book94,
author = {Ronald V. Book},
title = {On Collapsing the Polynomial-Time Hierarchy},
journal = {Inf. Process. Lett.},
volume = {52},
number = {5},
pages = {235--237},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00157-X},
doi = {10.1016/0020-0190(94)00157-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Book94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Tarui93,
author = {Jun Tarui},
title = {Probablistic Polynomials, {AC0} Functions, and the Polynomial-Time
Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {113},
number = {1},
pages = {167--183},
year = {1993},
url = {https://doi.org/10.1016/0304-3975(93)90214-E},
doi = {10.1016/0304-3975(93)90214-E},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Tarui93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Clote92,
author = {Peter Clote},
title = {A Time-Space Hierarchy Between Polynomial Time and Polynomial Space},
journal = {Math. Syst. Theory},
volume = {25},
number = {2},
pages = {77--92},
year = {1992},
url = {https://doi.org/10.1007/BF02835830},
doi = {10.1007/BF02835830},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Clote92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TodaO92,
author = {Seinosuke Toda and
Mitsunori Ogiwara},
title = {Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy},
journal = {{SIAM} J. Comput.},
volume = {21},
number = {2},
pages = {316--328},
year = {1992},
url = {https://doi.org/10.1137/0221023},
doi = {10.1137/0221023},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TodaO92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Young92,
author = {Paul Young},
title = {How reductions to sparse sets collapse the polynomial-time hierarchy:
a primer; part {I:} polynomial-time Turing reductions},
journal = {{SIGACT} News},
volume = {23},
number = {3},
pages = {107--117},
year = {1992},
url = {https://doi.org/10.1145/141914.141921},
doi = {10.1145/141914.141921},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Young92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Young92a,
author = {Paul Young},
title = {How reductions to sparse sets collapse the polynomial-time hierarchy:
a primer: Part {II} restricted polynomial-time reductions},
journal = {{SIGACT} News},
volume = {23},
number = {4},
pages = {83--94},
year = {1992},
url = {https://doi.org/10.1145/148080.148084},
doi = {10.1145/148080.148084},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Young92a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kadin91,
author = {Jim Kadin},
title = {Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy
Collapses},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {2},
pages = {404},
year = {1991},
url = {https://doi.org/10.1137/0220025},
doi = {10.1137/0220025},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kadin91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Toda91,
author = {Seinosuke Toda},
title = {{PP} is as Hard as the Polynomial-Time Hierarchy},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {5},
pages = {865--877},
year = {1991},
url = {https://doi.org/10.1137/0220053},
doi = {10.1137/0220053},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Toda91.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}
}
@article{DBLP:journals/ita/Ko90,
author = {Ker{-}I Ko},
title = {A note on separating the relativized polynomial time hierarchy by
immune sets},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {24},
pages = {229--240},
year = {1990},
url = {https://doi.org/10.1051/ita/1990240302291},
doi = {10.1051/ITA/1990240302291},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/Ko90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ko90,
author = {Ker{-}I Ko},
title = {Separating and Collapsing Results on the Relativized Probabilistic
Polynomial-Time Hierarchy},
journal = {J. {ACM}},
volume = {37},
number = {2},
pages = {415--438},
year = {1990},
url = {https://doi.org/10.1145/77600.77623},
doi = {10.1145/77600.77623},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ko90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BookT89,
author = {Ronald V. Book and
Shouwen Tang},
title = {A Note on Sparse Sets and the Polynomial-Time Hierarchy},
journal = {Inf. Process. Lett.},
volume = {33},
number = {3},
pages = {141--143},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90193-2},
doi = {10.1016/0020-0190(89)90193-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BookT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Cai89,
author = {Jin{-}yi Cai},
title = {With Probability One, a Random Oracle Separates {PSPACE} from the
Polynomial-Time Hierarchy},
journal = {J. Comput. Syst. Sci.},
volume = {38},
number = {1},
pages = {68--85},
year = {1989},
url = {https://doi.org/10.1016/0022-0000(89)90033-0},
doi = {10.1016/0022-0000(89)90033-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Cai89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/us/Kadin88,
author = {Jim Kadin},
title = {Restricted Turing Reducibilities {\&} the Structure of the Polynomial
Time Hierarchy},
school = {Cornell University, {USA}},
year = {1988},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/us/Kadin88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Torenvliet88,
author = {Leen Torenvliet},
title = {A Second Step Toward the Strong Polynomial-Time Hierarchy},
journal = {Math. Syst. Theory},
volume = {21},
number = {2},
pages = {99--123},
year = {1988},
url = {https://doi.org/10.1007/BF02088009},
doi = {10.1007/BF02088009},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Torenvliet88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Kadin88,
author = {Jim Kadin},
title = {The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {6},
pages = {1263--1282},
year = {1988},
url = {https://doi.org/10.1137/0217080},
doi = {10.1137/0217080},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Kadin88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Gradel88,
author = {Erich Gr{\"{a}}del},
title = {Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {56},
pages = {289--301},
year = {1988},
url = {https://doi.org/10.1016/0304-3975(88)90136-3},
doi = {10.1016/0304-3975(88)90136-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Gradel88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Kadin88,
author = {Jim Kadin},
title = {The polynomial time hierarchy collapses if the Boolean hierarchy collapses},
booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference,
Georgetown University, Washington, D. C., USA, June 14-17, 1988},
pages = {278--292},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SCT.1988.5287},
doi = {10.1109/SCT.1988.5287},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Kadin88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Chlebus87,
author = {Bogdan S. Chlebus},
title = {A note on the polynomial-time hierarchy and the quantified Boolean
formulas},
journal = {Bull. {EATCS}},
volume = {31},
pages = {15--21},
year = {1987},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Chlebus87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Babai87,
author = {L{\'{a}}szl{\'{o}} Babai},
title = {Random Oracles Separate {PSPACE} from the Polynomial-Time Hierarchy},
journal = {Inf. Process. Lett.},
volume = {26},
number = {1},
pages = {51--53},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90036-6},
doi = {10.1016/0020-0190(87)90036-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Babai87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Schnorr87,
author = {Claus{-}Peter Schnorr},
title = {A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms},
journal = {Theor. Comput. Sci.},
volume = {53},
pages = {201--224},
year = {1987},
url = {https://doi.org/10.1016/0304-3975(87)90064-8},
doi = {10.1016/0304-3975(87)90064-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Schnorr87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BalcazarBS86,
author = {Jos{\'{e}} L. Balc{\'{a}}zar and
Ronald V. Book and
Uwe Sch{\"{o}}ning},
title = {The polynomial-time hierarchy and sparse oracles},
journal = {J. {ACM}},
volume = {33},
number = {3},
pages = {603--617},
year = {1986},
url = {https://doi.org/10.1145/5925.5937},
doi = {10.1145/5925.5937},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BalcazarBS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Cai86,
author = {Jin{-}yi Cai},
editor = {Alan L. Selman},
title = {With Probability One, {A} Random Oracle Separates {PSPACE} from the
Polynomial- Time Hierarchy},
booktitle = {Structure in Complexity Theory, Proceedings of the Conference hold
at the University of California, Berkeley, California, USA, June 2-5,
1986},
series = {Lecture Notes in Computer Science},
volume = {223},
pages = {104--104},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16486-3\_92},
doi = {10.1007/3-540-16486-3\_92},
timestamp = {Thu, 02 Feb 2023 13:27:01 +0100},
biburl = {https://dblp.org/rec/conf/coco/Cai86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cai86,
author = {Jin{-}yi Cai},
editor = {Juris Hartmanis},
title = {With Probability One, {A} Random Oracle Separates {PSPACE} from the
Polynomial-Time Hierarchy},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {21--29},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12133},
doi = {10.1145/12130.12133},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Cai86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Yao85,
author = {Andrew Chi{-}Chih Yao},
title = {Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {1--10},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.49},
doi = {10.1109/SFCS.1985.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Yao85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FurstSS84,
author = {Merrick L. Furst and
James B. Saxe and
Michael Sipser},
title = {Parity, Circuits, and the Polynomial-Time Hierarchy},
journal = {Math. Syst. Theory},
volume = {17},
number = {1},
pages = {13--27},
year = {1984},
url = {https://doi.org/10.1007/BF01744431},
doi = {10.1007/BF01744431},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FurstSS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Schoning81,
author = {Uwe Sch{\"{o}}ning},
title = {A note on complete sets for the polynomial-time hierarchy},
journal = {{SIGACT} News},
volume = {13},
number = {1},
pages = {30--34},
year = {1981},
url = {https://doi.org/10.1145/1008883.1008885},
doi = {10.1145/1008883.1008885},
timestamp = {Mon, 02 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigact/Schoning81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FurstSS81,
author = {Merrick L. Furst and
James B. Saxe and
Michael Sipser},
title = {Parity, Circuits, and the Polynomial-Time Hierarchy},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {260--270},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.35},
doi = {10.1109/SFCS.1981.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FurstSS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Angluin80,
author = {Dana Angluin},
title = {On Counting Problems and the Polynomial-Time Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {12},
pages = {161--173},
year = {1980},
url = {https://doi.org/10.1016/0304-3975(80)90027-4},
doi = {10.1016/0304-3975(80)90027-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Angluin80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Stockmeyer76,
author = {Larry J. Stockmeyer},
title = {The Polynomial-Time Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {3},
number = {1},
pages = {1--22},
year = {1976},
url = {https://doi.org/10.1016/0304-3975(76)90061-X},
doi = {10.1016/0304-3975(76)90061-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Stockmeyer76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Wrathall76,
author = {Celia Wrathall},
title = {Complete Sets and the Polynomial-Time Hierarchy},
journal = {Theor. Comput. Sci.},
volume = {3},
number = {1},
pages = {23--33},
year = {1976},
url = {https://doi.org/10.1016/0304-3975(76)90062-1},
doi = {10.1016/0304-3975(76)90062-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Wrathall76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-05-25 00:35 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
