165 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?
TheoremDB P3760 · algorithms
TheoremDB P3746 · algorithms
TheoremDB P9580 · Candidate awaiting source review
TheoremDB P8658 · Candidate awaiting source review
TheoremDB P9964 · Candidate awaiting source review
TheoremDB P10000 · Candidate awaiting source review
TheoremDB P3140 · theoretical computer science
TheoremDB P3764 · algorithms
TheoremDB P3726 · algorithms
TheoremDB P2600 · formal languages
TheoremDB P2560 · automata theory
TheoremDB P3130 · theoretical computer science
TheoremDB P2832 · theoretical computer science
TheoremDB P3720 · algorithms
TheoremDB P3750 · distributed algorithms
TheoremDB P3730 · automata theory
TheoremDB P2834 · theoretical computer science
TheoremDB P3724 · automata theory
TheoremDB P3768 · automata theory
TheoremDB P3146 · theoretical computer science
TheoremDB P3144 · theoretical computer science