{"id":"https://openalex.org/W2041224156","doi":"https://doi.org/10.1142/s0129054106004339","title":"ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS","display_name":"ON THE COMPLEXITY OF COUNTING FIXED POINTS AND GARDENS OF EDEN IN SEQUENTIAL DYNAMICAL SYSTEMS ON PLANAR BIPARTITE GRAPHS","publication_year":2006,"publication_date":"2006-09-18","ids":{"openalex":"https://openalex.org/W2041224156","doi":"https://doi.org/10.1142/s0129054106004339","mag":"2041224156"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054106004339","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004339","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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/A5034907446","display_name":"Predrag T. To\u0161i\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PREDRAG T. TO\u0160I\u0106","raw_affiliation_strings":["Open Systems Laboratory, () Department of Computer Science, University of Illinois at Urbana-Champaign, 1334 Thomas Siebel Center for Computer Science, 201 N. Goodwin Avenue, Urbana, IL 61801, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Open Systems Laboratory, () Department of Computer Science, University of Illinois at Urbana-Champaign, 1334 Thomas Siebel Center for Computer Science, 201 N. Goodwin Avenue, Urbana, IL 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034907446"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":1.6637,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.83576445,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"17","issue":"05","first_page":"1179","last_page":"1203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9976999759674072,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9976999759674072,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9901999831199646,"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/bipartite-graph","display_name":"Bipartite graph","score":0.787140965461731},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6237748861312866},{"id":"https://openalex.org/keywords/counting-problem","display_name":"Counting problem","score":0.606602668762207},{"id":"https://openalex.org/keywords/dynamical-systems-theory","display_name":"Dynamical systems theory","score":0.5871778726577759},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.5842326879501343},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5697430372238159},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5531814098358154},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.42325618863105774},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37186676263809204},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3582109808921814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31434813141822815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2583417296409607}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.787140965461731},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6237748861312866},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.606602668762207},{"id":"https://openalex.org/C79379906","wikidata":"https://www.wikidata.org/wiki/Q3174497","display_name":"Dynamical systems theory","level":2,"score":0.5871778726577759},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.5842326879501343},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5697430372238159},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5531814098358154},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.42325618863105774},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37186676263809204},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3582109808921814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31434813141822815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2583417296409607},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054106004339","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004339","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.430.1463","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.430.1463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2005/091/revision/1/download/","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":51,"referenced_works":["https://openalex.org/W14067180","https://openalex.org/W24957722","https://openalex.org/W40699841","https://openalex.org/W179592015","https://openalex.org/W284492748","https://openalex.org/W636001276","https://openalex.org/W1513303009","https://openalex.org/W1523296758","https://openalex.org/W1531090979","https://openalex.org/W1531992391","https://openalex.org/W1584854500","https://openalex.org/W1597286183","https://openalex.org/W1824395512","https://openalex.org/W1830866146","https://openalex.org/W1932819214","https://openalex.org/W1964821516","https://openalex.org/W1971504722","https://openalex.org/W1975341317","https://openalex.org/W1975501803","https://openalex.org/W1978245109","https://openalex.org/W1981097681","https://openalex.org/W1986397639","https://openalex.org/W2000331453","https://openalex.org/W2000451777","https://openalex.org/W2006912660","https://openalex.org/W2009921057","https://openalex.org/W2009982923","https://openalex.org/W2011039300","https://openalex.org/W2011723719","https://openalex.org/W2012041962","https://openalex.org/W2019107258","https://openalex.org/W2024710200","https://openalex.org/W2027223427","https://openalex.org/W2033515910","https://openalex.org/W2043660429","https://openalex.org/W2065597356","https://openalex.org/W2076223914","https://openalex.org/W2106285343","https://openalex.org/W2107430728","https://openalex.org/W2115826669","https://openalex.org/W2127028562","https://openalex.org/W2128084896","https://openalex.org/W2135459959","https://openalex.org/W2137407595","https://openalex.org/W2483473095","https://openalex.org/W2729821211","https://openalex.org/W2730227384","https://openalex.org/W4205636972","https://openalex.org/W4213009134","https://openalex.org/W4254702493","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W4297789459","https://openalex.org/W1562935500","https://openalex.org/W2514259333","https://openalex.org/W2137552781"],"abstract_inverted_index":{"We":[0,80,91,173],"study":[1],"counting":[2,65,83,126,188],"various":[3],"types":[4,135],"of":[5,10,22,47,50,64,72,109,124,130,136,156,183,191],"configurations":[6,74,85,138],"in":[7,56,75,87],"certain":[8],"classes":[9],"graph":[11,19],"automata":[12,20],"viewed":[13],"as":[14,40,169],"discrete":[15,177],"dynamical":[16,178],"systems.":[17,53],"The":[18],"models":[21,36],"our":[23],"interest":[24,192],"are":[25,114,139,148,201],"Sequential":[26],"and":[27,32,69,78,104,112,132,146,154],"Synchronous":[28],"Dynamical":[29],"Systems":[30],"(SDSs":[31],"SyDSs,":[33],"respectively).":[34],"These":[35],"have":[37],"been":[38],"proposed":[39],"the":[41,61,66,70,101,105,122,144,181,197],"mathematical":[42],"foundation":[43],"for":[44],"a":[45,164,170],"theory":[46],"large-scale":[48],"simulations":[49],"complex":[51],"multi-agent":[52],"Our":[54],"emphasis":[55],"this":[57,95],"paper":[58],"is":[59,193],"on":[60],"computational":[62],"complexity":[63],"fixed":[67,127],"point":[68],"garden":[71],"Eden":[73,131],"Boolean":[76,171],"SDSs":[77,111,145],"SyDSs.":[79],"show":[81,93],"that":[82,94,121],"these":[84,110,176],"is,":[86],"general,":[88],"computationally":[89],"intractable.":[90],"also":[92],"intractability":[96],"still":[97],"holds":[98],"when":[99,196],"both":[100],"underlying":[102],"graphs":[103],"node":[106],"update":[107,166],"rules":[108],"SyDSs":[113,147],"severely":[115],"restricted.":[116],"In":[117],"particular,":[118],"we":[119],"prove":[120],"problems":[123,200],"exactly":[125],"points,":[128],"gardens":[129],"two":[133],"other":[134],"S(y)DS":[137],"all":[140],"#P-complete,":[141],"even":[142,195],"if":[143],"defined":[149],"over":[150],"planar":[151],"bipartite":[152],"graphs,":[153],"each":[155],"their":[157],"nodes":[158],"updates":[159],"its":[160],"state":[161],"according":[162],"to":[163,180,203],"monotone":[165],"rule":[167],"given":[168],"formula.":[172],"thus":[174],"add":[175],"systems":[179],"list":[182],"those":[184],"problem":[185],"domains":[186],"where":[187],"combinatorial":[189],"structures":[190],"intractable":[194],"related":[198],"decision":[199],"known":[202],"be":[204],"efficiently":[205],"solvable.":[206]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}