Complete problems with L-samplable distributions

DOI10.1007/BF01933258zbMath0727.68037OpenAlexW1490212255MaRDI QIDQ804284

Per Grape

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933258

zbMATH Keywords

reducibilitycompletenesscomplexity classesDeterministic Bounded HaltingGraph Reachability

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Complete problems with L-samplable distributions

Cites Work

• Complete problems with L-samplable distributions
• On the theory of average case complexity
• Average Case Complete Problems
• The NP-completeness column: An ongoing guide

This page was built for publication: Complete problems with L-samplable distributions