10.1145/129712.129783
Crossref proceedings-article
ACM Press
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 (320)
Bibliography

Feige, U., & Lovász, L. (1992). Two-prover one-round proof systems. Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing - STOC ’92, 733–744.

Authors 2
  1. Uriel Feige (first)
  2. László Lovász (additional)
References 0 Referenced 92

None

Dates
Type When
Created 21 years, 9 months ago (Nov. 25, 2003, 11:40 a.m.)
Deposited 2 months, 1 week ago (June 18, 2025, 10:58 a.m.)
Indexed 2 months, 1 week ago (June 19, 2025, 6:23 a.m.)
Issued 33 years, 7 months ago (Jan. 1, 1992)
Published 33 years, 7 months ago (Jan. 1, 1992)
Published Print 33 years, 7 months ago (Jan. 1, 1992)
Funders 0

None

@inproceedings{Feige_1992, series={STOC ’92}, title={Two-prover one-round proof systems: their power and their problems (extended abstract)}, url={http://dx.doi.org/10.1145/129712.129783}, DOI={10.1145/129712.129783}, booktitle={Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC ’92}, publisher={ACM Press}, author={Feige, Uriel and Lovász, László}, year={1992}, pages={733–744}, collection={STOC ’92} }