{"id":"https://openalex.org/W2402480240","doi":"https://doi.org/10.1137/14099721x","title":"On the $AC^0$ Complexity of Subgraph Isomorphism","display_name":"On the $AC^0$ Complexity of Subgraph Isomorphism","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2402480240","doi":"https://doi.org/10.1137/14099721x","mag":"2402480240"},"language":"en","primary_location":{"id":"doi:10.1137/14099721x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099721x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5076480463","display_name":"Yuan Li","orcid":"https://orcid.org/0000-0002-7637-598X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yuan Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008113826","display_name":"Alexander Razborov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander Razborov","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5007686466","display_name":"Benjamin Rossman","orcid":"https://orcid.org/0009-0001-0247-5208"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Rossman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076480463"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01326881,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"46","issue":"3","first_page":"936","last_page":"971"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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.998199999332428,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8755524754524231},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.7457025051116943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6786868572235107},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.6751336455345154},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.594164252281189},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5707690119743347},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5211362838745117},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5185849666595459},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5107414722442627},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.507356584072113},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4653858244419098},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.43919315934181213},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37566083669662476},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.20387884974479675},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10511887073516846},{"id":"https://openalex.org/keywords/crystallography","display_name":"Crystallography","score":0.056614577770233154}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8755524754524231},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.7457025051116943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6786868572235107},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.6751336455345154},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.594164252281189},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5707690119743347},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5211362838745117},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5185849666595459},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5107414722442627},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.507356584072113},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4653858244419098},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.43919315934181213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37566083669662476},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.20387884974479675},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10511887073516846},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.056614577770233154},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C115624301","wikidata":"https://www.wikidata.org/wiki/Q895901","display_name":"Crystal structure","level":2,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/14099721x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14099721x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"mag:2402480240","is_oa":false,"landing_page_url":"http://eccc.hpi-web.de/report/2014/145","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"},{"id":"https://openalex.org/F4320334789","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1973819999","https://openalex.org/W1982187375","https://openalex.org/W2047871605","https://openalex.org/W2054605652","https://openalex.org/W2067431706","https://openalex.org/W2076164610","https://openalex.org/W2077940950","https://openalex.org/W2092904196","https://openalex.org/W2111829945","https://openalex.org/W2125763748","https://openalex.org/W2150004999","https://openalex.org/W2166965860","https://openalex.org/W2296148711","https://openalex.org/W4251265810"],"related_works":["https://openalex.org/W2608681412","https://openalex.org/W2997738535","https://openalex.org/W2949377398","https://openalex.org/W1157790564","https://openalex.org/W2984793906","https://openalex.org/W2963358149","https://openalex.org/W3075687921","https://openalex.org/W3125848164","https://openalex.org/W3128651212","https://openalex.org/W2949517590","https://openalex.org/W1981979669","https://openalex.org/W2972128333","https://openalex.org/W2791238975","https://openalex.org/W2261564226","https://openalex.org/W3015052924","https://openalex.org/W2992341061","https://openalex.org/W3016819954","https://openalex.org/W2888222923","https://openalex.org/W2256948834"],"abstract_inverted_index":{"Let":[0],"$P$":[1,121,195],"be":[2,108],"a":[3,8,20,25,124,152,162,204,217,245,252],"fixed":[4],"graph":[5,22,75],"(hereafter":[6],"called":[7],"\u201cpattern''),":[9],"and":[10,79,99,138,257,281],"let":[11],"${\\sc":[12,47,69,83,209,214,236,239],"Subgraph}(P)$":[13,48],"denote":[14],"the":[15,40,57,61,73,80,86,92,116,119,130,170,178,222,261,269,273,284],"problem":[16,276],"of":[17,35,52,95,118,154,165,174,177,184,206,272],"deciding":[18],"whether":[19],"given":[21],"$G$":[23,76],"contains":[24],"subgraph":[26,274],"isomorphic":[27],"to":[28,102,123,161,213,238],"$P$.":[29,96],"We":[30,150,198],"are":[31],"interested":[32],"in":[33,60,71,156],"$AC^0$-complexity":[34],"this":[36],"problem,":[37],"determined":[38],"by":[39,56,135],"smallest":[41],"possible":[42],"exponent":[43,94],"$C(P)$":[44],"for":[45,192,260],"which":[46,72],"possesses":[49],"bounded-depth":[50],"circuits":[51],"size":[53],"$n^{C(P)+o(1)}$.":[54],"Motivated":[55],"previous":[58],"research":[59],"area,":[62],"we":[63,225],"also":[64],"consider":[65],"its":[66],"\u201ccolorful\u201d":[67],"version":[68,82,271],"Subgraph}_\\mathsf{col}(P)$":[70,215],"target":[74],"is":[77,91,146,189,203,211,229,244,251,277],"$V(P)$-colored,":[78],"average-case":[81],"Subgraph}_\\mathsf{ave}(P)$":[84],"under":[85],"distribution":[87],"$G(n,n^{-\\theta(P)})$,":[88],"where":[89],"$\\theta(P)$":[90],"threshold":[93],"Defining":[97],"$C_\\mathsf{col}(P)$":[98,113],"$C_\\mathsf{ave}(P)$":[100,155],"analogously":[101],"$C(P)$,":[103],"our":[104],"main":[105],"contributions":[106],"can":[107],"summarized":[109],"as":[110],"follows:":[111],"(1)":[112],"coincides":[114],"with":[115,254],"treewidth":[117],"pattern":[120,194],"up":[122,160],"logarithmic":[125],"factor.":[126],"This":[127,167,264],"shows":[128,168],"that":[129,169,200,227,234,268],"previously":[131],"known":[132],"upper":[133],"bound":[134,172],"Alon,":[136],"Yuster,":[137],"Zwick":[139],"[J.":[140],"ACM,":[141],"42":[142],"(1995),":[143],"pp.":[144,187],"844--856]":[145],"almost":[147],"tight.":[148],"(2)":[149],"give":[151],"characterization":[153],"purely":[157],"combinatorial":[158],"terms":[159],"multiplicative":[163],"factor":[164],"2.":[166],"lower":[171],"technique":[173],"Rossman":[175],"[Proceedings":[176],"40th":[179],"ACM":[180],"Symposium":[181],"on":[182,247],"Theory":[183],"Computing,":[185],"2008,":[186],"721--730]":[188],"essentially":[190],"tight":[191],"any":[193],"whatsoever.":[196],"(3)":[197],"prove":[199],"if":[201],"$Q$":[202],"minor":[205],"$P$,":[207],"then":[208],"Subgraph}_\\mathsf{col}(Q)$":[210],"reducible":[212],"via":[216],"linear-size":[218],"monotone":[219,231],"projection.":[220],"At":[221],"same":[223],"time,":[224],"show":[226],"there":[228],"no":[230],"projection":[232],"whatsoever":[233],"reduces":[235],"Subgraph}(M_3)$":[237],"Subgraph}(P_3":[240],"+":[241],"M_2)$":[242],"($P_3$":[243],"path":[246],"three":[248],"vertices,":[249],"$M_k$":[250],"matching":[253],"$k$":[255],"edges,":[256],"\u201c+\u201d":[258],"stands":[259],"disjoint":[262],"union).":[263],"result":[265],"strongly":[266],"suggests":[267],"colorful":[270],"isomorphism":[275],"much":[278],"better":[279],"structured":[280],"well-behaved":[282],"than":[283],"standard":[285],"(worst-case,":[286],"uncolored)":[287],"one.":[288]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}