Encoding invariance in average case complexity
From MaRDI portal
Publication:1678756
DOI10.1007/s00224-013-9517-5zbMath1380.68233OpenAlexW2060628418MaRDI QIDQ1678756
Publication date: 7 November 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9517-5
average-case complexitypolynomial-time computable distributionpolynomial-time samplable distribution
Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cites Work