open-problems

you can click on the tags to filter and view problems by category

This is a curated collection of open problems in theoretical computer science and mathematics. While excellent resources like the Complexity Zoo and Open Problem Garden already catalog many such problems, this page goes a step further: I highlight key problems, explore recent progress, and share my personal insights and reflections along the way.

  1. P vs BPP Problem

    Can every problem solvable efficiently with randomness also be solved efficiently without it?

    2025-07-16 Complexity Theory

  2. P vs NP Problem

    Can every problem whose solution can be verified quickly also be solved quickly?

    2025-07-12 Complexity Theory