{"id":"https://openalex.org/W7170161167","doi":"https://doi.org/10.4230/lipics.ccc.2026.19","title":"When Hilbert Approximates: A Strong Nullstellensatz for Approximate Polynomial Satisfiability","display_name":"When Hilbert Approximates: A Strong Nullstellensatz for Approximate Polynomial Satisfiability","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170161167","doi":"https://doi.org/10.4230/lipics.ccc.2026.19"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.19","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.19","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134951509","display_name":"Sanyam Agarwal","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Agarwal, Sanyam","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122045809","display_name":"Sagnik Dutta","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dutta, Sagnik","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056035704","display_name":"Anurag Pandey","orcid":"https://orcid.org/0000-0001-8473-1705"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Pandey, Anurag","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5143503511","display_name":"Himanshu Shukla","orcid":null},"institutions":[{"id":"https://openalex.org/I60668342","display_name":"University of Regensburg","ror":"https://ror.org/01eezs655","country_code":"DE","type":"education","lineage":["https://openalex.org/I60668342"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Shukla, Himanshu","raw_affiliation_strings":["Universit\u00e4t Regensburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Regensburg, Germany","institution_ids":["https://openalex.org/I60668342"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5626999735832214},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5612000226974487},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5475999712944031},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5246999859809875},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.48170000314712524},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.46000000834465027},{"id":"https://openalex.org/keywords/subring","display_name":"Subring","score":0.4580000042915344},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39089998602867126},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.3601999878883362}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8367999792098999},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5626999735832214},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5612000226974487},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5475999712944031},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5246999859809875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5163999795913696},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.48170000314712524},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.46000000834465027},{"id":"https://openalex.org/C21714298","wikidata":"https://www.wikidata.org/wiki/Q929536","display_name":"Subring","level":3,"score":0.4580000042915344},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4260999858379364},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39089998602867126},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.3601999878883362},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C68363185","wikidata":"https://www.wikidata.org/wiki/Q180969","display_name":"Algebraic geometry","level":2,"score":0.3560999929904938},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.3337000012397766},{"id":"https://openalex.org/C185579658","wikidata":"https://www.wikidata.org/wiki/Q3554813","display_name":"Affine variety","level":3,"score":0.3091999888420105},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C67996461","wikidata":"https://www.wikidata.org/wiki/Q629933","display_name":"Subalgebra","level":3,"score":0.28450000286102295},{"id":"https://openalex.org/C2777019822","wikidata":"https://www.wikidata.org/wiki/Q390066","display_name":"Containment (computer programming)","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C9485509","wikidata":"https://www.wikidata.org/wiki/Q1455652","display_name":"Polynomial ring","level":3,"score":0.26510000228881836},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C163635466","wikidata":"https://www.wikidata.org/wiki/Q3099696","display_name":"Monic polynomial","level":3,"score":0.25619998574256897}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.19","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.19","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Guo,":[0,89,216],"Saxena,":[1,90,217],"and":[2,27,32,38,56,61,91,203,218],"Sinhababu":[3],"(TOC'18,":[4],"CCC'18)":[5],"defined":[6,141],"a":[7,39,162,166,185],"natural,":[8],"approximative":[9,97,111,127,138],"analog":[10,104,120],"of":[11,30,82,96,105,121,144,165,169,215],"the":[12,49,63,76,86,110,126,158,174,195,204,212],"polynomial":[13,21,199,205],"system":[14],"satisfiability":[15,22],"problem,":[16],"which":[17],"they":[18],"called":[19],"approximate":[20],"(APS).":[23],"They":[24,45],"proved":[25],"algebraic":[26,133],"geometric":[28],"properties":[29],"it":[31],"showed":[33],"an":[34,103,119,132],"NP-hardness":[35],"lower":[36],"bound":[37,42,214],"PSPACE":[40,186],"upper":[41],"for":[43,69,94,135,188,198],"it.":[44],"further":[46],"established":[47],"how":[48],"problem":[50,64],"naturally":[51],"occurs":[52],"in":[53,71,109,125,157],"border":[54],"complexity":[55,58,213],"Geometric":[57],"theory":[59],"(GCT)":[60],"used":[62],"to":[65,152,155,183],"construct":[66],"hitting":[67],"sets":[68,140],"\u0305{VP}":[70],"PSPACE,":[72],"hence":[73,210],"greatly":[74],"mitigating":[75],"GCT":[77],"chasm.":[78],"The":[79],"starting":[80],"point":[81],"this":[83,148,190],"work":[84,116],"is":[85],"observation":[87],"that":[88],"Sinhababu\u2019s":[92,219],"criterion":[93,134],"non-existence":[95],"solution":[98,139],"can":[99],"be":[100,153],"interpreted":[101],"as":[102],"Weak":[106,220],"Hilbert\u2019s":[107,123],"Nullstellensatz":[108,124],"setting.":[112,128],"We":[113],"extend":[114],"their":[115],"by":[117,142,173],"proving":[118],"Strong":[122],"Concretely,":[129],"we":[130,179],"give":[131],"containment":[136],"between":[137],"systems":[143],"polynomials.":[145,176],"In":[146,177],"fact,":[147],"characterization":[149],"turns":[150],"out":[151],"equivalent":[154],"membership":[156,201,208],"integral":[159,206],"closure":[160,207],"over":[161],"maximal":[163],"ideal":[164],"local":[167],"subring":[168],"\u2102(x\u2081,\u2026,":[170],"x_n)":[171],"determined":[172],"given":[175],"addition,":[178],"use":[180],"our":[181],"proof":[182],"provide":[184],"algorithm":[187],"testing":[189,202],"containment,":[191],"exponentially":[192],"better":[193],"than":[194],"EXPSPACE":[196],"bounds":[197],"subalgebra":[200],"testing,":[209],"matching":[211],"Approximative":[221],"Nullstellensatz.":[222]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}