On the theory of average case complexity
- 30 April 1992
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 44 (2), 193-219
- https://doi.org/10.1016/0022-0000(92)90019-f
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Time polynomial in input or outputThe Journal of Symbolic Logic, 1989
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1984
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975