Complete problems with L-samplable distributions

DOI10.1007/BF01933258zbMATH Open0727.68037OpenAlexW1490212255MaRDI QIDQ804284FDOQ804284

Authors: Per Grape 

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

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

Recommendations

• Complete problems with L-samplable distributions
• Complexity of distributions and average-case hardness
• Structural complexity of AvgBPP
• scientific article
• On the theory of average case complexity

zbMATH Keywords

complexity classesreducibilitycompletenessDeterministic Bounded HaltingGraph Reachability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Complete problems with L-samplable distributions
• Complete problems with L-samplable distributions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804284)