{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:48:27Z","timestamp":1725486507813},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416357"},{"type":"electronic","value":"9783540445777"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44577-3_17","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T18:23:39Z","timestamp":1181413419000},"page":"251-256","source":"Crossref","is-referenced-by-count":0,"title":["Computational Complexity and Mathematical Proofs"],"prefix":"10.1007","author":[{"given":"Juris","family":"Hartmanis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Widgerson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In IEEE Symposium on Foundations of Computer Science, pages 174\u2013187, 1986.","DOI":"10.1109\/SFCS.1986.47"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"S. Goldwasser. Interactive proof systems. In Proceedings of Symposia in Applied Mathematics, pages 108\u2013128. American Mathematical Society, 1989.","DOI":"10.1090\/psapm\/038\/1020812"},{"key":"17_CR3","first-page":"166","volume":"41","author":"J. Hartmanis","year":"1990","unstructured":"J. Hartmanis, D. Ranjan R. Chang, and P. Rohatyi. On IP = PSPACE and theorems with narrow proofs. EATCS-Bulletin, 41:166\u2013174, 1990.","journal-title":"EATCS-Bulletin"},{"key":"17_CR4","unstructured":"C. Lund, L. Fortnow, H. Karlo., and N. Nisan. Algebraic methods for interactive proofs. In Proceedings 31st IEEE Symp. on the Foundations of Computer Science, pages 1\u201310, 1990."},{"key":"17_CR5","unstructured":"A. Shamir. IP = PSPACE. In Proc. 31st IEEE Symp. on the Foundations of Computer Science, pages 11\u201315, 1990."}],"container-title":["Lecture Notes in Computer Science","Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44577-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T08:23:22Z","timestamp":1550391802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44577-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416357","9783540445777"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-44577-3_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}