{"id":"https://openalex.org/W1502835965","doi":"https://doi.org/10.1007/3-540-45841-7_34","title":"Complexity of Semi-algebraic Proofs","display_name":"Complexity of Semi-algebraic Proofs","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1502835965","doi":"https://doi.org/10.1007/3-540-45841-7_34","mag":"1502835965"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-45841-7_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45841-7_34","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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dr.ntu.edu.sg/bitstream/10356/95181/1/18.%20Complexity%20of%20semialgebraic%20proofs.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109431961","display_name":"Dima Grigoriev","orcid":null},"institutions":[{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"D. Grigoriev","raw_affiliation_strings":["UNIVERSITE DE RENNES"],"affiliations":[{"raw_affiliation_string":"UNIVERSITE DE RENNES","institution_ids":["https://openalex.org/I56067802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035077817","display_name":"Edward Hirsch","orcid":null},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"E. Hirsch","raw_affiliation_strings":["Steklov Institute of Mathematics at St.-Petersburg"],"affiliations":[{"raw_affiliation_string":"Steklov Institute of Mathematics at St.-Petersburg","institution_ids":["https://openalex.org/I2800906181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015696190","display_name":"Dmitrii V. \u1e56asechnik","orcid":"https://orcid.org/0000-0002-7557-6886"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"D. Pasechnik","raw_affiliation_strings":["Department of Technical Mathematics and Informatics, Faculty ITS, Delft, University of Technology, CD Delft, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Technical Mathematics and Informatics, Faculty ITS, Delft, University of Technology, CD Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109431961"],"corresponding_institution_ids":["https://openalex.org/I56067802"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0653016,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":"4","first_page":"419","last_page":"430"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9854999780654907,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9553999900817871,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9495999813079834,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.7696963548660278},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.6873603463172913},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6790859699249268},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6720788478851318},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5641381144523621},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5468995571136475},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5436827540397644},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.45921728014945984},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4451785385608673},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4366961717605591},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.42984020709991455},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.0795963704586029}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7696963548660278},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6873603463172913},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6790859699249268},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6720788478851318},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5641381144523621},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5468995571136475},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5436827540397644},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.45921728014945984},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4451785385608673},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4366961717605591},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.42984020709991455},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.0795963704586029},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1007/3-540-45841-7_34","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-45841-7_34","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":"doi:10.17323/1609-4514-2002-2-4-647-679","is_oa":false,"landing_page_url":"https://doi.org/10.17323/1609-4514-2002-2-4-647-679","pdf_url":null,"source":{"id":"https://openalex.org/S28565804","display_name":"Moscow Mathematical Journal","issn_l":"1609-3321","issn":["1609-3321","1609-4514"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310322131","host_organization_name":"Independent University of Moscow","host_organization_lineage":["https://openalex.org/P4310322131"],"host_organization_lineage_names":["Independent University of Moscow"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Moscow Mathematical Journal","raw_type":"journal-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/95181","is_oa":true,"landing_page_url":"http://hdl.handle.net/10220/9273","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/95181/1/18.%20Complexity%20of%20semialgebraic%20proofs.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"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":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.2445","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.2445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eccc.uni-trier.de/eccc-reports/2001/TR01-103/revisn01.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.640","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.640","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eccc.uni-trier.de/eccc-reports/2001/TR01-103/Paper.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.6778","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.6778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.maths.univ-rennes1.fr/~dima/pub/pasechnik_guirche.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.1266","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.1266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eccc.uni-trier.de/eccc-reports/2001/TR01-103/revisn02.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.5883","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.5883","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eccc.uni-trier.de/eccc-reports/2001/TR01-103/revisn03.ps","raw_type":"text"},{"id":"pmh:oai:HAL:hal-03047115v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03047115","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Moscow Mathematical Journal, 2002","raw_type":"Journal articles"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:1436f343-d629-461c-86f5-f55165f7bed9","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:1436f343-d629-461c-86f5-f55165f7bed9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Journal article"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:62dec999-a331-4bda-81c2-ab1e6a7f3c1e","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:62dec999-a331-4bda-81c2-ab1e6a7f3c1e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science","raw_type":"Book"},{"id":"mag:1502835965","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:dr.ntu.edu.sg:10356/95181","is_oa":true,"landing_page_url":"http://hdl.handle.net/10220/9273","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/95181/1/18.%20Complexity%20of%20semialgebraic%20proofs.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"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":"Journal Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1502835965.pdf","grobid_xml":"https://content.openalex.org/works/W1502835965.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1568620904","https://openalex.org/W1603398055","https://openalex.org/W1893254807","https://openalex.org/W1968655942","https://openalex.org/W1988083342","https://openalex.org/W1996256832","https://openalex.org/W2011805810","https://openalex.org/W2012805418","https://openalex.org/W2022749269","https://openalex.org/W2026189949","https://openalex.org/W2038193643","https://openalex.org/W2044095368","https://openalex.org/W2045652876","https://openalex.org/W2056382067","https://openalex.org/W2078561631","https://openalex.org/W2078608416","https://openalex.org/W2093396771","https://openalex.org/W2098022011","https://openalex.org/W2098642112","https://openalex.org/W2102977254","https://openalex.org/W2106264302","https://openalex.org/W2145243417","https://openalex.org/W2146471456","https://openalex.org/W2167508847","https://openalex.org/W2323554188","https://openalex.org/W2492280620"],"related_works":["https://openalex.org/W3113860026","https://openalex.org/W153015188","https://openalex.org/W2965705192","https://openalex.org/W2136687801","https://openalex.org/W2012805418","https://openalex.org/W3013031282","https://openalex.org/W2160909640","https://openalex.org/W1998375896","https://openalex.org/W2164743591","https://openalex.org/W2056382067","https://openalex.org/W145900249","https://openalex.org/W1981949200","https://openalex.org/W2767976260","https://openalex.org/W3028950990","https://openalex.org/W2126482858","https://openalex.org/W2974433403","https://openalex.org/W2809620386","https://openalex.org/W2029390834","https://openalex.org/W2162703074","https://openalex.org/W2009304285"],"abstract_inverted_index":{"Proof":[0],"systems":[1,43,92],"for":[2,85,116,135],"polynomial":[3,34,99],"inequalities":[4,35],"in":[5,129],"0-1":[6],"variables":[7],"include":[8],"the":[9,17,42,59,68,113,117],"well-studied":[10],"Cutting":[11],"Planes":[12],"proof":[13,88,114,136],"system":[14],"(CP)":[15],"and":[16,81],"Lov\u00e1sz-":[18],"Schrijver":[19],"calculi":[20],"(LS)":[21],"utilizing":[22],"linear,":[23],"respectively,":[24],"quadratic,":[25],"inequalities.":[26],"We":[27,51],"introduce":[28],"generalizations":[29],"LSd":[30,44,56],"of":[31,36,58,101],"LS":[32],"involving":[33],"degree":[37,55,76],"at":[38],"most":[39],"d.":[40],"Surprisingly,":[41],"turn":[45],"out":[46],"to":[47],"be":[48],"very":[49],"strong.":[50],"construct":[52],"polynomial-size":[53,65],"bounded":[54,75,105],"proofs":[57],"clique-coloring":[60],"tautologies":[61,83],"(which":[62,72],"have":[63],"no":[64,74],"CP":[66,102],"proofs),":[67,80],"symmetric":[69],"knapsack":[70],"problem":[71],"has":[73],"Positivstellensatz":[77],"Calculus":[78],"(PC)":[79],"Tseitin\u2019s":[82],"(hard":[84],"many":[86],"known":[87],"systems).":[89],"Extending":[90],"our":[91],"with":[93,103],"a":[94,98],"division":[95],"rule":[96],"yields":[97],"simulation":[100],"polynomially":[104],"coefficients,":[106],"while":[107],"other":[108],"extra":[109],"rules":[110],"further":[111],"reduce":[112],"degrees":[115],"aforementioned":[118],"examples.":[119],"Finally,":[120],"we":[121],"prove":[122],"lower":[123],"bounds":[124],"on":[125],"Lov\u00e1sz-Schrijver":[126],"ranks,":[127],"demonstrating,":[128],"particular,":[130],"their":[131],"rather":[132],"limited":[133],"applicability":[134],"complexity.":[137]},"counts_by_year":[],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}