No article text was recorded for this version.
average-case complexity assumptions
Version 1 of 113 papers21 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs
- Blog: From average case complexity to improper learning complexity
- Blog: Complexity Theoretic Limitations on Learning DNF's
- Blog: More data speeds up training time in learning halfspaces over sparse vectors
- Blog: Learnability of Parameter-Bounded Bayes Nets
- Blog: Hardness of Learning a Single Neuron with Adversarial Label Noise
- Blog: Open Problem: Online Local Learning
- Blog: Tight bounds on ℓ1 approximation and learning of self-bounding functions
- Blog: Hardness of Learning Neural Networks with Natural Weights
- Blog: Complexity Theoretic Limitations on Learning Halfspaces
- Blog: Oracles and Queries That Are Sufficient for Exact Learning
- Blog: On Learning vs. Refutation
- Blog: Inapproximability of VC Dimension and Littlestone's Dimension
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_average_case_complexity_assumptions_2ce26b9b,
title = {average-case complexity assumptions},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/average-case-complexity-assumptions/rdr_2ce26b9b4be54dee9a73b7eff1128df9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_average_case_complexity_assumptions_2ce26b9b_v1,
title = {average-case complexity assumptions},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/average-case-complexity-assumptions/rdr_2ce26b9b4be54dee9a73b7eff1128df9/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}