Home

Open Problem Garden

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

PCP



Syndicate content

Navigate

  • Subject
    • Algebra (7)
    • Analysis (5)
    • Combinatorics (36)
    • Geometry (29)
    • Graph Theory (226)
    • Group Theory (5)
    • Logic (10)
    • Number Theory (48)
    • 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 (39)
    • Unsorted (1)
  • Author index
  • Keyword index
    • more

Recent Activity

  • Edge-Unfolding Convex Polyhedra
  • Point sets with no empty pentagon
  • Singmaster's conjecture
  • Waring rank of determinant
  • Monochromatic vertex colorings inherited from Perfect Matchings
more
Powered by  Drupal                       Hosted by  CSI of Charles University                       Content distributed under                       Disclaimer