@article{WRATHALL197623,
Abstract = {New proofs of two properties of the polynomial-time hierarchy are given. The classes in the hierarchy are characterized using polynomially bounded quantifiers. Using this result, a sequence of complete sets for the hierarchy is exhibited.},
Author = {Wrathall, Celia},
File = {Complete sets and the polynomial-time hierarchy - a - a - a - n.pdf},
ISSN = {0304-3975},
Journal = {Theoretical Computer Science},
Number = {1},
Pages = {23 - 33},
Title = {Complete sets and the polynomial-time hierarchy},
URL = {http://www.sciencedirect.com/science/article/pii/0304397576900621},
Volume = {3},
Year = {1976},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/0304397576900621},
bdsk-url-2 = {https://doi.org/10.1016/0304-3975(76)90062-1},
date-added = {2020-02-23 15:19:01 +0100},
date-modified = {2020-02-23 15:19:01 +0100},
doi = {10.1016/0304-3975(76)90062-1}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A