Home

Open Problem Garden

  • Help
  • About
  • Contact
  login/create account
Home » Subject » Theoretical Comp. Sci.

Complexity


TitleAuthor(s)sort iconImp.¹Rec.²SubtopicPosted by
Unconditional derandomization of Arthur-Merlin gamesShaltiel; Umans✭✭✭0Derandomizationormeir
Linear-size circuits for stable $0,1 < 2$ sorting?Regan✭✭1KWRegan
Complexity of square-root sumGoemans✭✭0abie
P vs. PSPACEFolklore✭✭✭0cwenner
P vs. BPPFolklore✭✭✭0DerandomizationCharles R Great...
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)Feige✭✭✭0Hardness of Approximationcwenner
Subset-sums equality (pigeonhole version)✭✭✭0mdevos
Discrete Logarithm Problem✭✭✭0cplxphil
One-way functions exist✭✭✭✭0porton

Imp.¹: Importance (Low ✭, Medium ✭✭, High ✭✭✭, Outstanding ✭✭✭✭)
Rec.²: Recommended for undergraduates.

Note: Resolved problems from this section may be found in Solved problems.

Syndicate content

Navigate

  • Subject
    • Algebra (295)
    • Analysis (5)
    • Combinatorics (35)
    • Geometry (29)
    • Graph Theory (228)
    • Group Theory (5)
    • Logic (10)
    • Number Theory (49)
    • PDEs (0)
    • Probability (1)
    • Theoretical Comp. Sci. (13)
      • Algorithms (2)
      • Coding Theory (1)
      • Complexity (9)
        • Derandomization (2)
        • Hardness Amplification (0)
        • Hardness of Approximation (1)
        • Interactive Proofs (0)
        • PCP (0)
      • Cryptography (0)
    • Topology (40)
    • Unsorted (1)
  • Author index
  • Keyword index
    • more

Recent Activity

  • Nowhere-zero flows
  • Shuffle-Exchange Conjecture
  • Algebra
  • Seagull problem
  • Solution to the Lonely Runner Conjecture
more
Powered by  Drupal                       Hosted by  CSI of Charles University                       Content distributed under                       Disclaimer