{"id":"https://openalex.org/W2153597031","doi":"https://doi.org/10.1109/sfcs.2003.1238228","title":"The complexity of homomorphism and constraint satisfaction problems seen from the other side","display_name":"The complexity of homomorphism and constraint satisfaction problems seen from the other side","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2153597031","doi":"https://doi.org/10.1109/sfcs.2003.1238228","mag":"2153597031"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238228","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","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/A5073893026","display_name":"Martin Grohe","orcid":"https://orcid.org/0000-0002-0292-9142"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M. Grohe","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt University of Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt University of Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073893026"],"corresponding_institution_ids":["https://openalex.org/I39343248"],"apc_list":null,"apc_paid":null,"fwci":10.3712,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.98712284,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"552","last_page":"561"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965000152587891,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9861000180244446,"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/homomorphism","display_name":"Homomorphism","score":0.93271803855896},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.7981929183006287},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7173326015472412},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6996057033538818},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6522573828697205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5875992774963379},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.559404730796814},{"id":"https://openalex.org/keywords/algebra-homomorphism","display_name":"Algebra homomorphism","score":0.5018961429595947},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49999523162841797},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.49261361360549927},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46912622451782227},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4324846863746643},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41186076402664185}],"concepts":[{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.93271803855896},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.7981929183006287},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7173326015472412},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6996057033538818},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6522573828697205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5875992774963379},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.559404730796814},{"id":"https://openalex.org/C175316100","wikidata":"https://www.wikidata.org/wiki/Q3882299","display_name":"Algebra homomorphism","level":3,"score":0.5018961429595947},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49999523162841797},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.49261361360549927},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46912622451782227},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4324846863746643},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41186076402664185},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.2003.1238228","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238228","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W52840101","https://openalex.org/W99828349","https://openalex.org/W132145278","https://openalex.org/W1494208392","https://openalex.org/W1558832481","https://openalex.org/W1565047086","https://openalex.org/W1579643516","https://openalex.org/W1811185933","https://openalex.org/W1979514837","https://openalex.org/W2018798767","https://openalex.org/W2018964411","https://openalex.org/W2022841964","https://openalex.org/W2026745535","https://openalex.org/W2027519504","https://openalex.org/W2028037658","https://openalex.org/W2033325972","https://openalex.org/W2034674470","https://openalex.org/W2046652577","https://openalex.org/W2049197377","https://openalex.org/W2049559029","https://openalex.org/W2050882124","https://openalex.org/W2057826895","https://openalex.org/W2061513598","https://openalex.org/W2073227282","https://openalex.org/W2073279331","https://openalex.org/W2077575555","https://openalex.org/W2085348754","https://openalex.org/W2116407296","https://openalex.org/W2129023820","https://openalex.org/W2134483537","https://openalex.org/W2150339067","https://openalex.org/W2158355632","https://openalex.org/W2166566648","https://openalex.org/W2628596753","https://openalex.org/W2913688336","https://openalex.org/W4212857488","https://openalex.org/W4248038814","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W6602175484","https://openalex.org/W6604062537","https://openalex.org/W6629425678","https://openalex.org/W6633933107","https://openalex.org/W6638468950","https://openalex.org/W6657372900","https://openalex.org/W6679742010","https://openalex.org/W6683407269"],"related_works":["https://openalex.org/W2397057935","https://openalex.org/W3162132578","https://openalex.org/W3021221643","https://openalex.org/W3000811452","https://openalex.org/W820932428","https://openalex.org/W2963207325","https://openalex.org/W70192758","https://openalex.org/W4298364136","https://openalex.org/W1949981435","https://openalex.org/W2153597031"],"abstract_inverted_index":{"We":[0,59],"give":[1],"a":[2,25,43,51,54,107],"complexity":[3,64,69],"theoretic":[4,65],"classification":[5,119],"of":[6,31,40,84,102],"homomorphism":[7,52,112],"problems":[8,113],"for":[9],"graphs":[10],"and,":[11],"more":[12],"generally,":[13],"relational":[14],"structures":[15,86,96],"obtained":[16],"by":[17],"restricting":[18],"the":[19,38,82,95,123],"left":[20],"hand":[21],"side":[22],"structure":[23,45,57],"in":[24,75,87,97],"homomorphism.":[26],"For":[27],"every":[28],"class":[29],"C":[30,49,88,98],"structures,":[32],"let":[33],"HOM(C,":[34,71],"/spl":[35,47,72],"I.bar/)":[36,73],"be":[37],"problem":[39],"deciding":[41],"whether":[42],"given":[44,55],"A":[46],"isin/":[48],"has":[50],"to":[53,106,122],"(arbitrary)":[56],"B.":[58],"prove":[60],"that,":[61],"under":[62],"some":[63],"assumption":[66],"from":[67],"parameterized":[68],"theory,":[70],"is":[74],"polynomial":[76],"time":[77],"if,":[78,81],"and":[79,114],"only":[80,99],"cores":[83],"all":[85],"have":[89],"bounded":[90,103],"tree-width":[91],"(as":[92],"long":[93],"as":[94],"contain":[100],"relations":[101],"arity).":[104],"Due":[105],"well":[108],"known":[109],"correspondence":[110],"between":[111],"constraint":[115],"satisfaction":[116],"problems,":[117],"our":[118],"carries":[120],"over":[121],"latter.":[124]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}