7 entries matching the current filters. Sorted by recently added.
Given a prime p , a generator g of mathbb F p^ and h ne0 , can a classical algorithm find x with g^x=h in time polynomial in log p ?
Can the minimum number of rotations transforming one rooted ordered binary tree into another be computed in polynomial time?
Can the winner from each vertex of a finite parity game be computed in time polynomial in the game's input size?
Is computing a canonical representative of a finite graph polynomial-time reducible to deciding graph isomorphism?
Does the polynomial hierarchy equal the class of languages decidable using polynomial space?
Can every language decidable in nondeterministic logarithmic space also be decided in deterministic logarithmic space?
Does every problem decidable in polynomial time admit a uniform family of polynomial-size Boolean circuits of polylogarithmic depth?