Some Observations about the Randomness of Hard Problems
From MaRDI portal
Publication:3756525
Recommendations
Cited in
(7)- Properties of uniformly hard languages
- Almost everywhere high nonuniform complexity
- Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
- Random languages for nonuniform complexity classes
- The Complexity and Distribution of Hard Problems
- On solving hard problems by polynomial-size circuits
- Nonuniform complexity and the randomness of certain complete languages
This page was built for publication: Some Observations about the Randomness of Hard Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756525)