{"id":"https://openalex.org/W2146375788","doi":"https://doi.org/10.2307/420993","title":"Linear Logic Proof Games and Optimization","display_name":"Linear Logic Proof Games and Optimization","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2146375788","doi":"https://doi.org/10.2307/420993","mag":"2146375788"},"language":"en","primary_location":{"id":"doi:10.2307/420993","is_oa":false,"landing_page_url":"https://doi.org/10.2307/420993","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003908930","display_name":"Patrick Lincoln","orcid":null},"institutions":[{"id":"https://openalex.org/I1298353152","display_name":"SRI International","ror":"https://ror.org/05s570m15","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1298353152"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Patrick D. Lincoln","raw_affiliation_strings":["Sri International Computer Science Laboratory, Menlo Park CA 94025, USA. E-mail:","Sri International Computer Science Laboratory, Menlo Park CA 94025, USA. E-mail: lincoln@csl.sri.com"],"affiliations":[{"raw_affiliation_string":"Sri International Computer Science Laboratory, Menlo Park CA 94025, USA. E-mail:","institution_ids":["https://openalex.org/I1298353152"]},{"raw_affiliation_string":"Sri International Computer Science Laboratory, Menlo Park CA 94025, USA. E-mail: lincoln@csl.sri.com","institution_ids":["https://openalex.org/I1298353152"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101897622","display_name":"John C. Mitchell","orcid":"https://orcid.org/0000-0002-0024-860X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John C. Mitchell","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA 94305-9045, USA. E-mail:","Department of Computer Science, Stanford University, Stanford, CA 94305-9045, USA. E-mail: mitchell@cs.stanford.edu, http/theory.stanford.edu/people/jcm/home.html"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305-9045, USA. E-mail:","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305-9045, USA. E-mail: mitchell@cs.stanford.edu, http/theory.stanford.edu/people/jcm/home.html","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054465062","display_name":"Andre Scedrov","orcid":"https://orcid.org/0000-0002-4536-0419"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andre Scedrov","raw_affiliation_strings":["Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395, USA. E-mail:","Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395, USA. E-mail: scedrov@cis.upenn.edu, http/www.cis.upenn.edu~scedrov"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395, USA. E-mail:","institution_ids":["https://openalex.org/I79576946","https://openalex.org/I922845939"]},{"raw_affiliation_string":"Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395, USA. E-mail: scedrov@cis.upenn.edu, http/www.cis.upenn.edu~scedrov","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003908930"],"corresponding_institution_ids":["https://openalex.org/I1298353152"],"apc_list":null,"apc_paid":null,"fwci":0.5153,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69242533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":"3","first_page":"322","last_page":"338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10237","display_name":"Cryptography and Data Security","score":0.9990000128746033,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7851086854934692},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6732063293457031},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6105417013168335},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5587935447692871},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.544579803943634},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.540152907371521},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5200871229171753},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.49312636256217957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4749600887298584},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4542449712753296},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.43741604685783386},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4082578718662262},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4079572558403015},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.22667047381401062},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17992717027664185},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12216123938560486},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.07898956537246704}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7851086854934692},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6732063293457031},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6105417013168335},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5587935447692871},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.544579803943634},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.540152907371521},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5200871229171753},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.49312636256217957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4749600887298584},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4542449712753296},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.43741604685783386},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4082578718662262},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4079572558403015},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.22667047381401062},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17992717027664185},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12216123938560486},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.07898956537246704},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2307/420993","is_oa":false,"landing_page_url":"https://doi.org/10.2307/420993","pdf_url":null,"source":{"id":"https://openalex.org/S130801046","display_name":"Bulletin of Symbolic Logic","issn_l":"1079-8986","issn":["1079-8986","1943-5894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.bsl/1182353452","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.bsl/1182353452","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.27.3837","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.3837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ucla.edu/~asl/bsl/0203/0203-003.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W12091626","https://openalex.org/W151008459","https://openalex.org/W173723324","https://openalex.org/W204341840","https://openalex.org/W1575454925","https://openalex.org/W1583038314","https://openalex.org/W1590029082","https://openalex.org/W1595252626","https://openalex.org/W1686539397","https://openalex.org/W1923324835","https://openalex.org/W1970606468","https://openalex.org/W1990313671","https://openalex.org/W1996605832","https://openalex.org/W2011039300","https://openalex.org/W2021289373","https://openalex.org/W2082647621","https://openalex.org/W2094685149","https://openalex.org/W2096131896","https://openalex.org/W2132265554","https://openalex.org/W2132605415","https://openalex.org/W2141815340","https://openalex.org/W2143391442","https://openalex.org/W2148957455","https://openalex.org/W2165318736","https://openalex.org/W2165641429","https://openalex.org/W2166463841","https://openalex.org/W2293988196","https://openalex.org/W2295428206","https://openalex.org/W2895234266","https://openalex.org/W2911865844","https://openalex.org/W2913756572","https://openalex.org/W4213009134","https://openalex.org/W4231916799","https://openalex.org/W4242214925","https://openalex.org/W4254084739"],"related_works":["https://openalex.org/W1523547988","https://openalex.org/W4233053549","https://openalex.org/W2144557478","https://openalex.org/W1483438220","https://openalex.org/W1676587966","https://openalex.org/W2963209704","https://openalex.org/W2595899102","https://openalex.org/W1768862053","https://openalex.org/W1629505938","https://openalex.org/W2421475109"],"abstract_inverted_index":{"\u00a7":[0],"1.":[1],"Introduction":[2],".":[3,242],"Perhaps":[4],"the":[5,14,17,39,60,71,138,185,191,251,259],"most":[6,222,232],"surprising":[7,181,260],"recent":[8],"development":[9],"in":[10,45,70,77,99,158,177,216,272],"complexity":[11],"theory":[12],"is":[13,44,81,98,103,156,166,183,214,266,275,333],"discovery":[15,182],"that":[16,30,41,94,132,146,170,184,189,203,247,267,365],"class":[18,72],"NP":[19,73,163],"can":[20,122,196],"be":[21,197],"characterized":[22],"using":[23,362],"a":[24,33,42,46,63,67,85,89,95,125,129,159,167,200,217,233,244,279,286,293,363,372,376],"form":[25],"of":[26,36,38,62,74,124,143,236,238,289,296,371],"randomized":[27],"proof":[28,131,144,169,187,195,209,253,373],"checker":[29,145,188],"only":[31],"examines":[32],"constant":[34,234,294],"number":[35,235,288,295],"bits":[37,237,297],"\u201cproof\u201d":[40],"string":[43,64,96,105,126,154],"language":[47,68,160,270],"[6,":[48],"5,":[49],"31,":[50],"3,":[51],"4].":[52],"More":[53],"specifically,":[54],"writing":[55],"\u2223":[56,58,112,114,225,310,312,337,339],"x":[57,65,97,118,133,155,171,206,226,239,302,315,328,343],"for":[59,268,300,327],"length":[61],",":[66,136,174,211,305,331],"L":[69,100,135,161,173,178,271,304,330],"languages":[75],"recognizable":[76],"Nondeterministic":[78],"polynomial":[79,86,280],"time":[80],"traditionally":[82],"given":[83],"by":[84,199,375],"p":[87,116],"and":[88,175,194,207,229,240,261,282,291,317,345],"polynomial-time":[90],"predicate":[91,139],"P":[92,108,140],"such":[93,298],"iff":[101],"there":[102,165,306,332],"some":[104,141],"y":[106,113,127,210,213,241,308,311,335,338],"satisfying":[107],"(x,":[109,320,348],"y),":[110],"where":[111,212],"\u2264":[115,313,340],"(\u2223":[117,342],"\u2223).":[119],"Intuitively,":[120],"we":[121],"think":[123],"as":[128],"possible":[130,208,276],"\u03f5":[134,162,172,303],"with":[137,309,318,323,336,346,351],"kind":[142],"distinguishes":[147],"good":[148],"proofs":[149],"from":[150],"bad":[151],"ones.":[152],"A":[153],"therefore":[157],"if":[164],"short":[168],"not":[176,249],"otherwise.":[179],"The":[180],"deterministic":[186],"reads":[190,230],"entire":[192],"input":[193,205],"replaced":[198],"probabilistic":[201,245],"verifier":[202,246,283],"on":[204],"presented":[215,374],"certain":[218],"way,":[219],"flips":[220],"at":[221,231],"O":[223],"(log":[224],"\u2223)":[227,316,344],"coins":[228,290],"Obviously,":[243],"does":[248],"read":[250],"whole":[252],"will":[254],"sometimes":[255],"make":[256],"mistakes.":[257],"However,":[258],"essentially":[262],"non-intuitive":[263],"mathematical":[264],"fact":[265],"each":[269],"NP,":[273],"it":[274],"to":[277,358],"find":[278],"q":[281,341],"V":[284,319,347],"flipping":[285],"logarithmic":[287],"reading":[292],"that,":[299],"any":[301],"exists":[307],"q(\u2223":[314],"y)":[321,349],"accepting":[322,350],"probability":[324,352],"1":[325],"and,":[326],"\u2209":[329],"no":[334],"\u2265":[353],"1/4.":[354],"This":[355],"idea":[356],"canalsobeextended":[357],"PSPACE":[359],"[10,":[360],"9],":[361],"game":[364],"alternates":[366],"between":[367],"two":[368],"players":[369],"instead":[370],"\u201csingle":[377],"player.\u201d":[378]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}