%0 Journal Article %1 Stockmeyer_1976 %A Stockmeyer, Larry J. %D 1976 %I Elsevier BV %J Theoretical Computer Science %K algorithms computationalcomplexity %N 1 %P 1--22 %R 10.1016/0304-3975(76)90061-x %T The polynomial-time hierarchy %U https://doi.org/10.1016%2F0304-3975%2876%2990061-x %V 3

@article{Stockmeyer_1976, added-at = {2019-11-30T21:18:15.000+0100}, author = {Stockmeyer, Larry J.}, biburl = {https://www.bibsonomy.org/bibtex/231668f8191f4d7c7273b4cb9c88da6e1/paves_intern}, doi = {10.1016/0304-3975(76)90061-x}, interhash = {b7eba2c075e6f2abb1207ed51aa3dd12}, intrahash = {31668f8191f4d7c7273b4cb9c88da6e1}, journal = {Theoretical Computer Science}, keywords = {algorithms computationalcomplexity}, month = oct, number = 1, pages = {1--22}, publisher = {Elsevier {BV}}, timestamp = {2019-11-30T21:18:15.000+0100}, title = {The polynomial-time hierarchy}, url = {https://doi.org/10.1016%2F0304-3975%2876%2990061-x}, volume = 3, year = 1976 }