Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Algebra and Number Theory
Reference17 articles.
1. L. Adlemann,Two Theorems on Random Polynomial Time, Proc. 19th IEEE Symp. Found. Comput. Sci., (1978), 75–83.
2. A. Bertoni, G. Mauri, M. Torelli,Sulla complessità di alcuni problemi di conteggio, Calcolo, XVII, (1980), 163–174.
3. P. Erdos, J. Spencer,Probabilistic Methods in Combinatorics, (1974), Academic Press, New York.
4. Lecture notes in control and optimization;A. Frigessi,1986
5. M. R. Garey, D. S. Johnson,Computers and Intractability: a Guide to the Theory of NP-Completeness, (1979), Freemann, San Francisco.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献