{"id":"https://openalex.org/W2218897312","doi":"https://doi.org/10.1007/978-3-662-47672-7_29","title":"Interactive Proofs with Approximately Commuting Provers","display_name":"Interactive Proofs with Approximately Commuting Provers","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2218897312","doi":"https://doi.org/10.1007/978-3-662-47672-7_29","mag":"2218897312"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-47672-7_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47672-7_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://infoscience.epfl.ch/handle/20.500.14299/256147","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5026395918","display_name":"Matthew Coudron","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matthew Coudron","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019616211","display_name":"Thomas Vidick","orcid":"https://orcid.org/0000-0002-6405-365X"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Vidick","raw_affiliation_strings":["California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026395918"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3414,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56439138,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"355","last_page":"366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10622","display_name":"Quantum Mechanics and Applications","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5642790198326111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5340439677238464},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5197969675064087},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5057477951049805},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5049148201942444},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5031649470329285},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5026781558990479},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.49553167819976807},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4929697513580322},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4741111397743225},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4704189598560333},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.463161826133728},{"id":"https://openalex.org/keywords/hilbert-space","display_name":"Hilbert space","score":0.4483703672885895},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3970857858657837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.354400098323822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2680361866950989},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.20689687132835388},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.1949285864830017},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18263643980026245},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.14128941297531128}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5642790198326111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5340439677238464},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5197969675064087},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5057477951049805},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5049148201942444},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5031649470329285},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5026781558990479},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.49553167819976807},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4929697513580322},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4741111397743225},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4704189598560333},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.463161826133728},{"id":"https://openalex.org/C62799726","wikidata":"https://www.wikidata.org/wiki/Q190056","display_name":"Hilbert space","level":2,"score":0.4483703672885895},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3970857858657837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.354400098323822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2680361866950989},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.20689687132835388},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.1949285864830017},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18263643980026245},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.14128941297531128},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-47672-7_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-47672-7_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/256147","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/256147","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:20.500.14299/256147","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/256147","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"conference proceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W109763408","https://openalex.org/W913429490","https://openalex.org/W1689842540","https://openalex.org/W1870070843","https://openalex.org/W1972937787","https://openalex.org/W1976554830","https://openalex.org/W1985083346","https://openalex.org/W1986407511","https://openalex.org/W1997865614","https://openalex.org/W1998250432","https://openalex.org/W2012287288","https://openalex.org/W2019578639","https://openalex.org/W2025323993","https://openalex.org/W2028815089","https://openalex.org/W2033376433","https://openalex.org/W2050190096","https://openalex.org/W2058302064","https://openalex.org/W2066346528","https://openalex.org/W2073801892","https://openalex.org/W2077397558","https://openalex.org/W2080578129","https://openalex.org/W2084499569","https://openalex.org/W2086653003","https://openalex.org/W2087431766","https://openalex.org/W2093419514","https://openalex.org/W2097206148","https://openalex.org/W2105098759","https://openalex.org/W2109815032","https://openalex.org/W2109989966","https://openalex.org/W2114382532","https://openalex.org/W2116397277","https://openalex.org/W2119901068","https://openalex.org/W2135830616","https://openalex.org/W2148352980","https://openalex.org/W2148791594","https://openalex.org/W2149974280","https://openalex.org/W2162178369","https://openalex.org/W2195657359","https://openalex.org/W2328912295","https://openalex.org/W2798707604","https://openalex.org/W2943245616","https://openalex.org/W2950303908","https://openalex.org/W2950502875","https://openalex.org/W2951124766","https://openalex.org/W3010301980","https://openalex.org/W3098184212","https://openalex.org/W3102418387","https://openalex.org/W3105429216","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W2122747219","https://openalex.org/W2095274905","https://openalex.org/W1486286946","https://openalex.org/W4288351008","https://openalex.org/W2018964411","https://openalex.org/W2949308819","https://openalex.org/W3033897917","https://openalex.org/W2026191634","https://openalex.org/W2945959217","https://openalex.org/W2057357905"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}