List of unsolved problems in computer science

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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.

Computational complexity[edit]

Polynomial versus non-polynomial time for specific algorithmic problems[edit]

Other algorithmic problems[edit]

Natural Language Processing algorithms[edit]

  • Is there any perfect syllabification algorithm in the English language?
  • Is there any perfect stemming algorithm in the English language?
  • Is there any perfect POS tagging algorithm in the English language?

Programming language theory[edit]

Other problems[edit]

References[edit]

  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, 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, ISBN 978-0-521-71522-5, 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 (PDF), Lecture Notes in Computer Science, 4271, Berlin: Springer, pp. 325–335, doi:10.1007/11917496_29, MR 2290741.

External links[edit]