Isomorphisms of NP complete problems on random instances
Author:
Belanger J.,Wang J.
Publisher
IEEE Comput. Soc. Press
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Average-Case Computational Complexity Theory;Complexity Theory Retrospective II;1997
2. Polynomial time samplable distributions;Mathematical Foundations of Computer Science 1996;1996
3. Sets computable in polynomial time on average;Lecture Notes in Computer Science;1995