@article{ dblp4702638,
  title = {Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols},
  author = {László Babai and Lance Fortnow and Carsten Lund},
  author_short = {Babai, L. and Fortnow, L. and Lund, C.},
  bibtype = {article},
  type = {article},
  year = {1992},
  key = {dblp4702638},
  id = {dblp4702638},
  biburl = {http://www.dblp.org/rec/bibtex/journals/cc/BabaiFL92},
  url = {http://dx.doi.org/10.1007/BF01200430},
  journal = {Computational Complexity (CC)},
  pages = {374},
  volume = {2},
  text = {Computational Complexity (CC) 2:374 (1992)}
}

{"_id":"4Bmg49XuGLJ3ocGpZ","bibbaseid":"babai-fortnow-lund-addendumtonondeterministicexponentialtimehastwoproverinteractiveprotocols-1992","downloads":0,"creationDate":"2016-02-09T20:13:37.709Z","title":"Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols","author_short":["Babai, L.","Fortnow, L.","Lund, C."],"year":1992,"bibtype":"article","biburl":"http://www.dblp.org/rec/bibtex/journals/cc/BabaiFL92","bibdata":{"title":"Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols","author":["László Babai","Lance Fortnow","Carsten Lund"],"author_short":["Babai, L.","Fortnow, L.","Lund, C."],"bibtype":"article","type":"article","year":"1992","key":"dblp4702638","id":"dblp4702638","biburl":"http://www.dblp.org/rec/bibtex/journals/cc/BabaiFL92","url":"http://dx.doi.org/10.1007/BF01200430","journal":"Computational Complexity (CC)","pages":"374","volume":"2","text":"Computational Complexity (CC) 2:374 (1992)","bibtex":"@article{ dblp4702638,\n title = {Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols},\n author = {László Babai and Lance Fortnow and Carsten Lund},\n author_short = {Babai, L. and Fortnow, L. and Lund, C.},\n bibtype = {article},\n type = {article},\n year = {1992},\n key = {dblp4702638},\n id = {dblp4702638},\n biburl = {http://www.dblp.org/rec/bibtex/journals/cc/BabaiFL92},\n url = {http://dx.doi.org/10.1007/BF01200430},\n journal = {Computational Complexity (CC)},\n pages = {374},\n volume = {2},\n text = {Computational Complexity (CC) 2:374 (1992)}\n}","bibbaseid":"babai-fortnow-lund-addendumtonondeterministicexponentialtimehastwoproverinteractiveprotocols-1992","role":"author","urls":{"Paper":"http://dx.doi.org/10.1007/BF01200430"},"downloads":0},"search_terms":["addendum","non","deterministic","exponential","time","two","prover","interactive","protocols","babai","fortnow","lund"],"keywords":[],"authorIDs":[],"dataSources":["R9hGqXG8r2TLozab7"]}