{"id":"https://openalex.org/W2150825551","doi":"https://doi.org/10.1109/lics.2002.1029839","title":"Complete problems for dynamic complexity classes","display_name":"Complete problems for dynamic complexity classes","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W2150825551","doi":"https://doi.org/10.1109/lics.2002.1029839","mag":"2150825551"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2002.1029839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029839","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-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/A5026280198","display_name":"William Hesse","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"W. Hesse","raw_affiliation_strings":["Computer Science Department, UMass, Amherst, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, UMass, Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053065200","display_name":"Neil Immerman","orcid":"https://orcid.org/0000-0001-6609-5952"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N. Immerman","raw_affiliation_strings":["Computer Science Department, UMass, Amherst, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, UMass, Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026280198"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":1.8172,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.86062513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"313","last_page":"322"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9980000257492065,"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/corollary","display_name":"Corollary","score":0.7172461748123169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6474512815475464},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.6246466636657715},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6085856556892395},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5384381413459778},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.5169957876205444},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4892887771129608},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.45552122592926025},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4364076256752014},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42845994234085083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3343682289123535},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.28017377853393555},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2627032697200775},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09357097744941711}],"concepts":[{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.7172461748123169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6474512815475464},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.6246466636657715},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6085856556892395},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5384381413459778},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.5169957876205444},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4892887771129608},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.45552122592926025},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4364076256752014},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42845994234085083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3343682289123535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.28017377853393555},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2627032697200775},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09357097744941711},{"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/lics.2002.1029839","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2002.1029839","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.7376","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.7376","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umass.edu/~whesse/complete.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.8268","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.8268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umass.edu/~immerman/pub/completeLICS.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.65.2735","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.2735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.umass.edu/~immerman/pub/completeLICS.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.2583","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.2583","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.clarkson.edu/~whesse/complete.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.856.6965","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.856.6965","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.umass.edu/%7Eimmerman/pub/newComplete.pdf","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":14,"referenced_works":["https://openalex.org/W241260042","https://openalex.org/W1491565545","https://openalex.org/W1556601737","https://openalex.org/W1908185546","https://openalex.org/W1970755596","https://openalex.org/W2009489912","https://openalex.org/W2041298014","https://openalex.org/W2045583484","https://openalex.org/W2078423836","https://openalex.org/W2569165898","https://openalex.org/W2614633957","https://openalex.org/W4236835455","https://openalex.org/W6633324141","https://openalex.org/W6661958532"],"related_works":["https://openalex.org/W4214737172","https://openalex.org/W3012938552","https://openalex.org/W2324712051","https://openalex.org/W2798639752","https://openalex.org/W1550311267","https://openalex.org/W4287825236","https://openalex.org/W1524103539","https://openalex.org/W1239946963","https://openalex.org/W1973527399","https://openalex.org/W71729059"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,11,17,42,77],"first":[3,30],"complete":[4,34,102],"problems":[5],"for":[6,35,65,103],"dynamic":[7,18],"complexity":[8],"classes":[9,12,19],"including":[10],"Dyn-FO":[13,36],"and":[14,24],"Dyn-ThC/sup":[15],"0/,":[16],"corresponding":[20],"to":[21],"relational":[22],"calculus":[23],"(polynomially":[25],"bounded)":[26],"SQL,":[27],"respectively.":[28],"The":[29],"problem":[31,45],"we":[32,93],"show":[33],"is":[37,60,101],"a":[38,54,62,91,95],"single-step":[39],"version":[40],"of":[41,84],"circuit":[43],"value":[44],"(SSCV).":[46],"Of":[47],"independent":[48],"interest,":[49],"our":[50],"construction":[51],"also":[52],"produces":[53],"first-order":[55,67,70,78,105],"formula,":[56],"/spl":[57,80],"zeta/,":[58],"that":[59,100],"in":[61],"sense":[63],"universal":[64],"all":[66,104],"formulas.":[68],"Since":[69],"formulas":[71,83],"are":[72],"stratified":[73],"by":[74,87],"quantifier":[75,97,106],"depth,":[76],"formula":[79],"zeta/":[81],"emulates":[82],"greater":[85],"depth":[86],"iterated":[88],"application.":[89],"As":[90],"corollary":[92],"obtain":[94],"fixed":[96],"block,":[98],"QBC,":[99],"blocks.":[107]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}