October 01, 1991 article PP is as Hard as the Polynomial-Time Hierarchy SIAM Journal on Computing DOI: 10.1137/0220053 OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 672 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The Complexity of Homomorphism Reconstructibility 2025 ACM Transactions on Computation Theory article Computer Science Advanced Graph Theory Research Open access 0 citations Life is Random, Time is Not: Markov Decision Processes with Window Objectives 2020 Logical Methods in Computer Science article Computer Science Formal Methods in Verification Open access 4 citations Counting Bounded Tree Depth Homomorphisms 2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access 21 citations 3 results References 0