Complete problems with L-samplable distributions

DOI10.1007/BF01933258MaRDI QIDQ804284zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

complexity classesreducibilitycompletenessDeterministic Bounded HaltingGraph Reachability

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 6474904 (Why is no real title available?)
• 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)