{"id":"https://openalex.org/W2143473941","doi":"https://doi.org/10.1145/2789208","title":"Upper Bounds for Newton\u2019s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata","display_name":"Upper Bounds for Newton\u2019s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata","publication_year":2015,"publication_date":"2015-09-11","ids":{"openalex":"https://openalex.org/W2143473941","doi":"https://doi.org/10.1145/2789208","mag":"2143473941"},"language":"en","primary_location":{"id":"doi:10.1145/2789208","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2789208","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/e80a0c5e-3e6f-4519-ac15-2966fe04cfef","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106184727","display_name":"Alistair Stewart","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Alistair Stewart","raw_affiliation_strings":["University of Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003946901","display_name":"Kousha Etessami","orcid":"https://orcid.org/0000-0001-5700-3462"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kousha Etessami","raw_affiliation_strings":["University of Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["Columbia University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5106184727"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.3634,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.66374572,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"62","issue":"4","first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"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/T11567","display_name":"semigroups and automata theory","score":0.9986000061035156,"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/mathematics","display_name":"Mathematics","score":0.6548693180084229},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6537413597106934},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5620816349983215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.537239134311676},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5367829203605652},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4795758128166199},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4708304703235626},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.44879499077796936},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.445607990026474},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.44484174251556396},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4250129461288452},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.417331337928772},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.35254305601119995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1807706356048584},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.08983111381530762}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6548693180084229},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6537413597106934},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5620816349983215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.537239134311676},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5367829203605652},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4795758128166199},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4708304703235626},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.44879499077796936},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.445607990026474},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.44484174251556396},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4250129461288452},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.417331337928772},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35254305601119995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1807706356048584},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.08983111381530762},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2789208","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2789208","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/e80a0c5e-3e6f-4519-ac15-2966fe04cfef","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/e80a0c5e-3e6f-4519-ac15-2966fe04cfef","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stewart, A, Etessami, K & Yannakakis, M 2015, 'Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-time Model Checking of Probabilistic One-Counter Automata', Journal of the ACM, vol. 62, no. 4, 30. https://doi.org/10.1145/2789208","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/e80a0c5e-3e6f-4519-ac15-2966fe04cfef","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/upper-bounds-for-newtons-method-on-monotone-polynomial-systems-and-ptime-model-checking-of-probabilistic-onecounter-automata(e80a0c5e-3e6f-4519-ac15-2966fe04cfef).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Stewart, A, Etessami, K & Yannakakis, M 2015, 'Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-time Model Checking of Probabilistic One-Counter Automata', Journal of the ACM, vol. 62, no. 4, 30. https://doi.org/10.1145/2789208","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/e80a0c5e-3e6f-4519-ac15-2966fe04cfef","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/e80a0c5e-3e6f-4519-ac15-2966fe04cfef","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Stewart, A, Etessami, K & Yannakakis, M 2015, 'Upper Bounds for Newton's Method on Monotone Polynomial Systems, and P-time Model Checking of Probabilistic One-Counter Automata', Journal of the ACM, vol. 62, no. 4, 30. https://doi.org/10.1145/2789208","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5099999904632568,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320319944","display_name":"Royal Society of Canada","ror":"https://ror.org/00xya3a34"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W391578156","https://openalex.org/W1256121109","https://openalex.org/W1483073639","https://openalex.org/W1496738390","https://openalex.org/W1602747308","https://openalex.org/W1966861855","https://openalex.org/W1972203711","https://openalex.org/W1975636681","https://openalex.org/W2005059149","https://openalex.org/W2009570821","https://openalex.org/W2040721698","https://openalex.org/W2062573385","https://openalex.org/W2097364072","https://openalex.org/W2117805292","https://openalex.org/W2128978199","https://openalex.org/W2133667894","https://openalex.org/W2142921329","https://openalex.org/W2142972886","https://openalex.org/W2143760481","https://openalex.org/W2148701797","https://openalex.org/W2151670874","https://openalex.org/W2154602821","https://openalex.org/W2167246417","https://openalex.org/W2552044278","https://openalex.org/W2568511220","https://openalex.org/W2610857016","https://openalex.org/W2975330931","https://openalex.org/W3099666054","https://openalex.org/W4245668478","https://openalex.org/W4256135625"],"related_works":["https://openalex.org/W2150672947","https://openalex.org/W2081116272","https://openalex.org/W2350164269","https://openalex.org/W2026354649","https://openalex.org/W1971591265","https://openalex.org/W2014258452","https://openalex.org/W820719587","https://openalex.org/W4299532155","https://openalex.org/W2097364072","https://openalex.org/W2951977842"],"abstract_inverted_index":{"A":[0],"central":[1],"computational":[2],"problem":[3],"for":[4,91,114,127,142,209,227,272],"analyzing":[5],"and":[6,28,38,75,199,254,284],"model":[7,269,274],"checking":[8],"various":[9],"classes":[10,116,129],"of":[11,35,54,61,82,111,117,130,160,166,171,192,206,225,243,247,270,281],"infinite-state":[12],"recursive":[13,29],"probabilistic":[14,25,286],"systems":[15],"(including":[16],"quasi-birth-death":[17],"processes,":[18,21],"multitype":[19],"branching":[20],"stochastic":[22],"context-free":[23],"grammars,":[24],"pushdown":[26],"automata":[27],"Markov":[30],"chains)":[31],"is":[32],"the":[33,48,88,108,157,167,172,194,204,248,261,266],"computation":[34],"termination":[36],"probabilities,":[37],"computing":[39,47],"these":[40],"probabilities":[41],"in":[42,73,241],"turn":[43],"boils":[44],"down":[45],"to":[46,87,139,216,218,276,291],"least":[49],"fixed":[50],"point":[51],"(LFP)":[52],"solution":[53,90,233],"a":[55,79,96,164,190],"corresponding":[56],"monotone":[57],"polynomial":[58],"system":[59],"(MPS)":[60],"equations,":[62],"denoted":[63],"x":[64,68,175,179],"=":[65,176],"P":[66,177],"(":[67,178],").":[69,180],"It":[70],"was":[71],"shown":[72],"Etessami":[74],"Yannakakis":[76],"[2009]":[77],"that":[78,94],"decomposed":[80,210],"variant":[81],"Newton\u2019s":[83,112,161,211],"method":[84,113,162,212],"converges":[85],"monotonically":[86],"LFP":[89,232],"any":[92,292],"MPS":[93,230],"has":[95],"nonnegative":[97],"solution.":[98],"Subsequently,":[99],"Esparza":[100],"et":[101,133],"al.":[102,134],"[2010]":[103],"obtained":[104,126],"upper":[105,122,150,187,236,252],"bounds":[106,123,151,237],"on":[107,156,203,256],"convergence":[109,158],"rate":[110,159],"certain":[115],"MPSs.":[118],"More":[119],"recently,":[120],"better":[121],"have":[124],"been":[125],"special":[128],"MPSs":[131],"[Etessami":[132],"2010,":[135],"2012].":[136],"However,":[137],"prior":[138,257],"this":[140,182],"article,":[141,183],"arbitrary":[143,229,278],"(not":[144],"necessarily":[145],"strongly":[146],"connected)":[147],"MPSs,":[148],"no":[149],"at":[152],"all":[153],"were":[154],"known":[155],"as":[163,189],"function":[165,191],"encoding":[168,196],"size":[169,197],"|P|":[170],"input":[173,195],"MPS,":[174],"In":[181],"we":[184,259],"provide":[185],"worst-case":[186],"bounds,":[188,253],"both":[193],"|P|,":[198],"\u03b5":[200,222],">":[201,223],"0,":[202],"number":[205],"iterations":[207],"required":[208],"(even":[213],"with":[214,231,289],"rounding)":[215],"converge":[217],"within":[219,277],"additive":[220],"error":[221],"0":[224],"q*,":[226],"an":[228],"q*.":[234],"Our":[235],"are":[238],"essentially":[239],"optimal":[240],"terms":[242],"several":[244],"important":[245],"parameters":[246],"problem.":[249],"Using":[250],"our":[251],"building":[255],"work,":[258],"obtain":[260],"first":[262],"P-time":[263],"algorithm":[264],"(in":[265],"standard":[267],"Turing":[268],"computation)":[271],"quantitative":[273],"checking,":[275],"desired":[279],"precision,":[280],"discrete-time":[282],"QBDs":[283],"(equivalently)":[285],"1-counter":[287],"automata,":[288],"respect":[290],"(fixed)":[293],"\u03c9":[294],"-regular":[295],"or":[296],"LTL":[297],"property.":[298]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}