1996
The complexity of generating and checking proofs of membership
Publication
Publication
Presented at the
International Symposium on Theoretical Aspects of Computer Science, Grenoble, France
Additional Metadata | |
---|---|
Springer | |
Lecture Notes in Computer Science | |
International Symposium on Theoretical Aspects of Computer Science | |
Buhrman, H., & Thierauf, T. (1996). The complexity of generating and checking proofs of membership. In STACS 96 (pp. 75–86). Springer. |