Average-Case Intractable NP Problems-Reference-Cited by-同舟云学术

Average-Case Intractable NP Problems

Published:1997 Issue: Volume: Page:313-378
ISSN:
Container-title:Advances in Algorithms, Languages, and Complexity
language:
Short-container-title:

Author:

Wang Jie

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4613-3394-4_15.pdf

Reference68 articles.

1. L. Adleman and K. Manders. The computational complexity of decision procedures for polynomials. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pages 169–177, 1975.

2. L. Adleman and K. Manders. Diophantine complexity. In Proceedings of the 17th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pages 81–88, 1976.

3. L. Babai, P. Erdos, and M. Selkow. Random graph isomorphism. SIAM Journal on Computing, 9: 628–635, 1980.

4. J. Belanger and J. Wang. No NP problems averaging over ranking of distributions are harder. Theoretical Computer Science, to appear.

5. J. Belanger and J. Wang. Isomorphisms of NP-complete problems on random instances. In Proceedings of the 8th Annual Conference on Structure in Complexity Theory, IEEE Computer Society Press, pages 65–74, 1993.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bibliography;Theory of Computational Complexity;2013-12-06

2. Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey;Annals of Mathematics and Artificial Intelligence;2013-06-08

3. On complete one-way functions;Problems of Information Transmission;2009-06

4. Guarantees for the success frequency of an algorithm for finding Dodgson-election winners;Journal of Heuristics;2007-12-28

5. Bibliography;North-Holland Mathematics Studies;2004