Author:
Biehl Ingrid,Buchmann Johannes,Meyer Bernd,Thiel Christian,Thiel Christoph
Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. M. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, 1979.
2. O. Goldreich, S. Micali, and A. Widgerson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM Vol. 38, pp. 691–729, 1991.
3. Harry R. Lewis and Christos H. Papadimitriou. Elements of the theory of Computation. Prentice-Hall, 1981.
4. K. R. Reischuk. Einführung in die Komplexitätstheorie. Teubner, 1990.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献