Toda's theorem
id:
toda-s-theorem-251-18266540
title:
Toda's theorem
text:
Toda's theorem is a result in computational complexity theory that was proven by Seinosuke Toda in his paper "PP is as Hard as the Polynomial-Time Hierarchy" and was given the 1998 Gödel Prize.
brand slug:
wiki
category slug:
encyclopedia
description:
The polynomial hierarchy is contained in probabilistic Turing machine in polynomial time
original url:
https://en.wikipedia.org/wiki/Toda%27s_theorem
date created:
date modified:
2020-06-08T21:45:31Z
main entity:
{"identifier":"Q719966","url":"https://www.wikidata.org/entity/Q719966"}
image:
fields total:
13
integrity:
14