11 Years of Service
18%
From Wikipedia, the free encyclopedia
This article is a
This link is hidden for visitors. Please Log in or register now.
This link is hidden for visitors. Please Log in or register now.
Contents
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
Computational complexity
Main article:
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
- What is the relationship between
andThis link is hidden for visitors. Please Log in or register now.?This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
- L = P problem
- L =
problemThis link is hidden for visitors. Please Log in or register now.
-
This link is hidden for visitors. Please Log in or register now.
- Is the
true?This link is hidden for visitors. Please Log in or register now.
Is the strong exponential time hypothesis (SETH) true?
[*]Do
This link is hidden for visitors. Please Log in or register now.
Ispossible?This link is hidden for visitors. Please Log in or register now.
[*]
This link is hidden for visitors. Please Log in or register now.
Polynomial versus non-polynomial time for specific algorithmic problems
Main article:
This link is hidden for visitors. Please Log in or register now.
- Can
be done inThis link is hidden for visitors. Please Log in or register now.on a classical (non-quantum) computer?This link is hidden for visitors. Please Log in or register now.
- Can
be found in polynomial time?This link is hidden for visitors. Please Log in or register now.
- Can the
be computed in polynomial time?This link is hidden for visitors. Please Log in or register now.
- Can the
be solved in polynomial time?This link is hidden for visitors. Please Log in or register now.
- Can
and k-leaf powers be recognized in polynomial time?This link is hidden for visitors. Please Log in or register now.
- Can
be solved in polynomial time?This link is hidden for visitors. Please Log in or register now.
- Can the
between twoThis link is hidden for visitors. Please Log in or register now.be computed in polynomial time?This link is hidden for visitors. Please Log in or register now.
- Can graphs of bounded
be recognized in polynomial time?This link is hidden for visitors. Please Log in or register now.This link is hidden for visitors. Please Log in or register now.
- Can one find a
on a convex polyhedron in polynomial time?This link is hidden for visitors. Please Log in or register now.This link is hidden for visitors. Please Log in or register now.
- Can a
with fixed edges for two given graphs be found in polynomial time?This link is hidden for visitors. Please Log in or register now.This link is hidden for visitors. Please Log in or register now.
Other algorithmic problems
- The
: do splay trees have a bounded competitive ratio?This link is hidden for visitors. Please Log in or register now.
- Is there a k-competitive online algorithm for the
?This link is hidden for visitors. Please Log in or register now.
- Can a
be constructed inThis link is hidden for visitors. Please Log in or register now.?This link is hidden for visitors. Please Log in or register now.
- Can the
be computed in o(n log n) time?This link is hidden for visitors. Please Log in or register now.
- What is the fastest
of two n-digit numbers?This link is hidden for visitors. Please Log in or register now.
- What is the lowest possible average-case time complexity of
with a deterministic, fixed gap sequence?This link is hidden for visitors. Please Log in or register now.
- Can
be solved in strongly sub-quadratic time, that is, in time O(n2−ϵ) for some ϵ>0?This link is hidden for visitors. Please Log in or register now.
- Can the
between two strings of length n be computed in strongly sub-quadratic time? (This is only possible if the strongThis link is hidden for visitors. Please Log in or register now.is false.)This link is hidden for visitors. Please Log in or register now.
- Can
be done in o(n2 log n) time?This link is hidden for visitors. Please Log in or register now.
- What is the fastest
?This link is hidden for visitors. Please Log in or register now.
- Can
be computed in strongly sub-cubic time, that is, in time O(V3−ϵ) for some ϵ>0?This link is hidden for visitors. Please Log in or register now.
- Can the
forThis link is hidden for visitors. Please Log in or register now.beThis link is hidden for visitors. Please Log in or register now.?This link is hidden for visitors. Please Log in or register now.
- Does
admit aThis link is hidden for visitors. Please Log in or register now.-time algorithm? (This is problem #9 inThis link is hidden for visitors. Please Log in or register now.of problems.)This link is hidden for visitors. Please Log in or register now.
- How many queries are required for
?This link is hidden for visitors. Please Log in or register now.
- What is the algorithm for the
that consistently generates playable mazes in the 1982This link is hidden for visitors. Please Log in or register now.gameThis link is hidden for visitors. Please Log in or register now.merely from the values of the five pixels adjacent to the next ones to be generated?This link is hidden for visitors. Please Log in or register now.