pith. sign in

arxiv: 1311.5467 · v1 · pith:26G3YTJ2new · submitted 2013-11-21 · 💻 cs.CC

Challenges in computational lower bounds

classification 💻 cs.CC
keywords boundschallengescomputationallowerbiasedcomplexitydrawincomplete
0
0 comments X
read the original abstract

We draw two incomplete, biased maps of challenges in computational complexity lower bounds.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.