{"id":"https://openalex.org/W2054977621","doi":"https://doi.org/10.1016/s0304-3975(99)00057-2","title":"Optimization complexity of linear logic proof games","display_name":"Optimization complexity of linear logic proof games","publication_year":1999,"publication_date":"1999-09-01","ids":{"openalex":"https://openalex.org/W2054977621","doi":"https://doi.org/10.1016/s0304-3975(99)00057-2","mag":"2054977621"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(99)00057-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00057-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]},{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Patrick D. Lincoln","raw_affiliation_strings":["International Computer Science Laboratory, Menlo Park CA 94025 USA"],"affiliations":[{"raw_affiliation_string":"International Computer Science Laboratory, Menlo Park CA 94025 USA","institution_ids":["https://openalex.org/I1297971548","https://openalex.org/I4210099336"]}]},{"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","Department of Computer Science Stanford University Stanford, CA, 94305-9045 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA 94305-9045 USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science Stanford University Stanford, CA, 94305-9045 USA","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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andre Scedrov","raw_affiliation_strings":["Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395 USA","Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104\u20136395, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395 USA","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104\u20136395, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5054465062"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.0393,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82018203,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"227","issue":"1-2","first_page":"299","last_page":"331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9846000075340271,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9846000075340271,"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.9639999866485596,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9531999826431274,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7035266160964966},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6539608240127563},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.6004912853240967},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.5955430865287781},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5516716241836548},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.5207726359367371},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.5201083421707153},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4984726905822754},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.49036693572998047},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.48682039976119995},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.4844484329223633},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.4662902057170868},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4585312604904175},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.42153996229171753},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.39941170811653137},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.38834184408187866},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.34577181935310364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2709183692932129},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2258051335811615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1839320957660675}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7035266160964966},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6539608240127563},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.6004912853240967},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.5955430865287781},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5516716241836548},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.5207726359367371},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.5201083421707153},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4984726905822754},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.49036693572998047},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.48682039976119995},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.4844484329223633},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.4662902057170868},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4585312604904175},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.42153996229171753},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.39941170811653137},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38834184408187866},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.34577181935310364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2709183692932129},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2258051335811615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1839320957660675},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0304-3975(99)00057-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(99)00057-2","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.20.7088","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.7088","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.stanford.edu/people/jcm/papers/lms-opt-lin-tcs.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.3048","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.3048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cis.upenn.edu/pub/papers/scedrov/approxTCS.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.3967","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.3967","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://theory.stanford.edu/pub/jcm/papers/lms-opt-lin-tcs.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2722497084","https://openalex.org/W4221157047","https://openalex.org/W2002057804","https://openalex.org/W1916795416","https://openalex.org/W3111955738","https://openalex.org/W1490051504","https://openalex.org/W2007362771","https://openalex.org/W44606644","https://openalex.org/W2141978322","https://openalex.org/W2911779022"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}