Scribd
Upload
740 views

List of Unsolved Problems in Computer Science

hgfhg

Uploaded by

Raghav Singal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
740 views

List of Unsolved Problems in Computer Science

hgfhg

Uploaded by

Raghav Singal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

List of unsolved problems in computer science

This article is a list of unsolved problems in computer science. 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
Polynomial versus non-polynomial time for specific algorithmic problems
Other algorithmic problems
Programming language theory
Other problems
References
External links

Computational complexity
P versus NP problem (occasionally written erroneously as "P = NP")
What is the relationship betweenBQP and NP?
NC = P problem
NP = co-NP problem
P = BPP problem
P = PSPACE problem
L = NL problem
L = P problem
L = RL problem
Unique games conjecture
Is the exponential time hypothesistrue?
Do one-way functions exist?

Is public-key cryptographypossible?

Polynomial versus non-polynomial time for specific algorithmic


problems
Can integer factorization be done in polynomial time on a classical (non-quantum) computer?
Is integer factorization NP-complete?
Can clustered planar drawingsbe found in polynomial time?
Can the discrete logarithm be computed in polynomial time?
Can the graph isomorphism problembe solved in polynomial time?
Can leaf powers and k-leaf powers be recognized in polynomial time?
Can parity games be solved in polynomial time?
Can the rotation distance between two binary trees be computed in polynomial time?
Can graphs of boundedclique-width be recognized in polynomial time?[1]
Can one find a simple closed quasigeodesicon a convex polyhedron in polynomial time?[2]
[3]
Can a simultaneous embeddingwith fixed edges for two given graphs be found in polynomial time?
Other algorithmic problems
What is the fastest algorithm for multiplicationof two n-digit numbers?
What is the fastest algorithm for matrix multiplication?
Can the Schwartz–Zippel lemmafor polynomial identity testingbe derandomized?
Can a depth-first search tree be constructed in NC?
Does linear programming admit a strongly polynomial-time algorithm? This is problem #9 inSmale's list of problems.
What is the lower bound on the complexity offast Fourier transform algorithms? Can they be faster than
O(N log N)?
The dynamic optimality conjecture: do splay trees have a bounded competitive ratio?
Can we compute the edit distance between two strings of lengthn in strongly sub-quadratic time, i.e., in time
O(n2−ϵ) for some ϵ>0 ?
Is there a k-competitive online algorithm for thek-server problem?
Can X + Y sorting be done in strictly less thanO(n2 log n) time?
How many queries are required forenvy-free cake-cutting?
What is the lowest possible average-case time complexity ofShellsort with a deterministic, fixed gap sequence?

Programming language theory


POPLmark
Barendregt–Geuvers–Klop conjecture

Other problems
Aanderaa–Karp–Rosenberg conjecture
Generalized star height problem
Separating words problem
Possibility of hypercomputation

References
1. Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan (2009), "Clique-width is NP-complete",
SIAM Journal on Discrete Mathematics, 23 (2): 909–939, doi:10.1137/070687256 (https://doi.org/10.1137%2F07068
7256), MR 2519936 (https://www.ams.org/mathscinet-getitem?mr=2519936).
2. Demaine, Erik D.; O'Rourke, Joseph (2007), "24 Geodesics: Lyusternik–Schnirelmann", Geometric folding
algorithms: Linkages, origami, polyhedra, Cambridge: Cambridge University Press, pp. 372–375,
doi:10.1017/CBO9780511735172(https://doi.org/10.1017%2FCBO9780511735172) , ISBN 978-0-521-71522-5,
MR 2354878 (https://www.ams.org/mathscinet-getitem?mr=2354878).
3. Gassner, Elisabeth; Jünger, Michael; Percan, Merijam; Schaefer, Marcus; Schulz, Michael (2006), "Simultaneous
graph embeddings with fixed edges",Graph-Theoretic Concepts in Computer Science: 32nd International Workshop,
WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, Lecture Notes in Computer Science,4271, Berlin:
Springer, pp. 325–335, doi:10.1007/11917496_29(https://doi.org/10.1007%2F11917496_29), MR 2290741 (https://
www.ams.org/mathscinet-getitem?mr=2290741).

External links
Open problems around exact algorithmsby Gerhard J. Woeginger, Discrete Applied Mathematics 156 (2008) 397–
405.
The RTA list of open problems– open problems in rewriting.
The TLCA List of Open Problems– open problems in areatyped lambda calculus.

Retrieved from "https://en.wikipedia.org/w/index.php?


title=List_of_unsolved_problems_in_computer_science&oldid=807056709
"
This page was last edited on 25 October 2017, at 16:36.

Text is available under theCreative Commons Attribution-ShareAlike License ; additional terms may apply. By using this
site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of theWikimedia
Foundation, Inc., a non-profit organization.

You might also like