Jump to content
YOUR-AD-HERE
HOSTING
TOOLS

Locked List of unsolved problems in computer science

0x1

By INACTIVE 0x1
in FYI

 Share

Recommended Posts

0x1 Little Hacker

INACTIVE 0x1

Posted
Posted
From Wikipedia, the free encyclopedia
This is the hidden content, please
 
This article is a
This is the hidden content, please
in
This is the hidden content, please
. A problem in computer science is considered unsolved when no solution is known, or when experts in the field disagree about proposed solutions.

Contents

Computational complexity

Main article:
This is the hidden content, please

Polynomial versus non-polynomial time for specific algorithmic problems

Main article:
This is the hidden content, please
  • Can
    This is the hidden content, please
    be done in
    This is the hidden content, please
    on a classical (non-quantum) computer?
  • Can
    This is the hidden content, please
    be found in polynomial time?
  • Can the
    This is the hidden content, please
    be computed in polynomial time?
  • Can the
    This is the hidden content, please
    be solved in polynomial time?
  • Can
    This is the hidden content, please
    and k-leaf powers be recognized in polynomial time?
  • Can
    This is the hidden content, please
    be solved in polynomial time?
  • Can the
    This is the hidden content, please
    between two
    This is the hidden content, please
    be computed in polynomial time?
  • Can graphs of bounded
    This is the hidden content, please
    be recognized in polynomial time?
    This is the hidden content, please
  • Can one find a
    This is the hidden content, please
    on a convex polyhedron in polynomial time?
    This is the hidden content, please
  • Can a
    This is the hidden content, please
    with fixed edges for two given graphs be found in polynomial time?
    This is the hidden content, please

Other algorithmic problems

  • The
    This is the hidden content, please
    : do splay trees have a bounded competitive ratio?
  • Is there a k-competitive online algorithm for the
    This is the hidden content, please
    ?
  • Can a
    This is the hidden content, please
    be constructed in
    This is the hidden content, please
    ?
  • Can the
    This is the hidden content, please
    be computed in o(n log n) time?
  • What is the fastest
    This is the hidden content, please
    of two n-digit numbers?
  • What is the lowest possible average-case time complexity of
    This is the hidden content, please
    with a deterministic, fixed gap sequence?
  • Can
    This is the hidden content, please
    be solved in strongly sub-quadratic time, that is, in time O(n2−ϵ) for some ϵ>0?
  • Can the
    This is the hidden content, please
    between two strings of length n be computed in strongly sub-quadratic time? (This is only possible if the strong
    This is the hidden content, please
    is false.)
  • Can
    This is the hidden content, please
    be done in o(n2 log n) time?
  • What is the fastest
    This is the hidden content, please
    ?
  • Can
    This is the hidden content, please
    be computed in strongly sub-cubic time, that is, in time O(V3−ϵ) for some ϵ>0?
  • Can the
    This is the hidden content, please
    for
    This is the hidden content, please
    be
    This is the hidden content, please
    ?
  • Does
    This is the hidden content, please
    admit a
    This is the hidden content, please
    -time algorithm? (This is problem #9 in
    This is the hidden content, please
    of problems.)
  • How many queries are required for
    This is the hidden content, please
    ?
  • What is the algorithm for the
    This is the hidden content, please
    that consistently generates playable mazes in the 1982
    This is the hidden content, please
    game
    This is the hidden content, please
     merely from the values of the five pixels adjacent to the next ones to be generated?
Link to comment
Share on other sites
Guest
This topic is now closed to further replies.
 Share
Go to topic listing
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.