Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

Question on the Polynomial Hierarchy

0 views
Skip to first unread message

Lou Pagnucco

unread,
Aug 21, 2010, 3:00:06 PM8/21/10
to
Is there any easily described parameterized problem sequence,
P1, P2, P3, ...., such that

the problem class Pk is exactly n^k poly-time?


0 new messages