Open Problem Garden

Help
About
Contact

login/create account

Home » Subject » Theoretical Comp. Sci. » Complexity

Hardness Amplification

Navigate

Subject
- Algebra (6)
- Analysis (5)
- Combinatorics (36)
- Geometry (28)
- Graph Theory (224)
- Group Theory (5)
- Logic (10)
- Number Theory (47)
- 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

Recent Activity

Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Monochromatic reachability in arc-colored digraphs
3-Decomposition Conjecture
Which outer reloids are equal to inner ones
A diagram about funcoids and reloids

Powered by

Drupal Hosted by

CSI of Charles University Content distributed under

Disclaimer