{"id":"https://openalex.org/W99828349","doi":null,"title":"Complexity of K-tree structured constraint satisfaction problems","display_name":"Complexity of K-tree structured constraint satisfaction problems","alternate_titles":[],"publication_year":1990,"publication_date":"1990-07-29","ids":{"openalex":"https://openalex.org/W99828349","mag":"99828349"},"language":"en","primary_location":{"id":"mag:99828349","doi":null,"is_oa":false,"landing_page_url":"http://aaaipress.org/Papers/AAAI/1990/AAAI90-001.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W99828349"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5042721881","display_name":"Eugene C. Freuder","orcid":"https://orcid.org/0000-0002-1467-5012","observed_orcids":["https://orcid.org/0000-0002-1467-5012"]},"institutions":[{"id":"https://openalex.org/I161057412","display_name":"University of New Hampshire","ror":"https://ror.org/01rmh9n78","country_code":"US","type":"education","lineage":["https://openalex.org/I161057412"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Eugene C. Freuder","raw_affiliation_strings":["Department of Computer Science, University of New Hampshire, Durham, New Hampshire#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-1467-5012","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Hampshire, Durham, New Hampshire#TAB#","institution_ids":["https://openalex.org/I161057412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042721881"],"corresponding_institution_ids":["https://openalex.org/I161057412"],"apc_list":null,"apc_paid":null,"fwci":3.9253,"has_fulltext":false,"cited_by_count":244,"citation_normalized_percentile":{"value":0.93745262,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"4","last_page":"9"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6923999786376953,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6923999786376953,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.30640000104904175,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.00039999998989515007,"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/constraint-satisfaction","display_name":"constraint satisfaction","score":0.8889999985694885},{"id":"https://openalex.org/keywords/k-trees","display_name":"k-trees","score":0.972000002861023},{"id":"https://openalex.org/keywords/partial-k-trees","display_name":"partial k-trees","score":0.9879999756813049},{"id":"https://openalex.org/keywords/representational-complexity","display_name":"representational complexity","score":0.8339999914169312},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.9890000224113464},{"id":"https://openalex.org/keywords/graph-structure","display_name":"graph structure","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C183046576","wikidata":"https://www.wikidata.org/wiki/Q5164380","display_name":"Constraint satisfaction dual problem","level":5,"score":0.7544683218002319},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7165005207061768},{"id":"https://openalex.org/C132180345","wikidata":"https://www.wikidata.org/wiki/Q5156628","display_name":"Complexity of constraint satisfaction","level":5,"score":0.6769443154335022},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6401863098144531},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6362244486808777},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5808889269828796},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5609437823295593},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4896236062049866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4646361172199249},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.4596206247806549},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.4543350338935852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42990541458129883},{"id":"https://openalex.org/C56289965","wikidata":"https://www.wikidata.org/wiki/Q5249246","display_name":"Decision tree model","level":3,"score":0.41116511821746826},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3581320643424988},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2928381860256195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27678292989730835},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.18175512552261353},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17281043529510498},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.1532554030418396},{"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":"mag:99828349","doi":null,"is_oa":false,"landing_page_url":"http://aaaipress.org/Papers/AAAI/1990/AAAI90-001.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"National Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W159907047","https://openalex.org/W2002478775","https://openalex.org/W2034501206","https://openalex.org/W2037106315","https://openalex.org/W2038674294","https://openalex.org/W2061734130","https://openalex.org/W2069683773","https://openalex.org/W2081414924","https://openalex.org/W2085550081","https://openalex.org/W2166930257"],"related_works":["https://openalex.org/W2339954935","https://openalex.org/W4252758033","https://openalex.org/W2085550081","https://openalex.org/W2475219067","https://openalex.org/W162177841","https://openalex.org/W1603704271","https://openalex.org/W6941475762","https://openalex.org/W2166643800","https://openalex.org/W7120609058","https://openalex.org/W1603707154"],"abstract_inverted_index":{"Trees":[0],"have":[1,84],"played":[2],"a":[3,27,44],"key":[4],"role":[5],"in":[6,50,57],"the":[7,51,79],"study":[8],"of":[9,29,53,66],"constraint":[10,39],"satisfaction":[11,40],"problems":[12,14],"because":[13],"with":[15],"tree":[16],"structure":[17],"can":[18,33],"be":[19,75],"solved":[20],"efficiently.":[21],"It":[22],"is":[23],"shown":[24],"here":[25],"that":[26],"family":[28],"generalized":[30],"trees,":[31],"k-trees,":[32],"offer":[34],"increasing":[35],"representational":[36,95],"complexity":[37,48],"for":[38,63],"problems,":[41],"while":[42],"maintaining":[43],"bound":[45],"on":[46],"computational":[47,98],"linear":[49],"number":[52],"variables":[54],"and":[55,97],"exponential":[56],"k.":[58],"Additional":[59],"results":[60],"are":[61,92],"obtained":[62],"larger":[64],"classes":[65],"graphs":[67],"known":[68],"as":[69],"partial":[70,87],"k-trees.":[71],"These":[72],"methods":[73],"may":[74],"helpful":[76],"even":[77],"when":[78],"original":[80],"problem":[81],"does":[82],"not":[83],"k-tree":[85,88],"or":[86],"structure.":[89],"Specific":[90],"tradeoffs":[91],"suggested":[93],"between":[94],"power":[96],"complexity.":[99]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W99828349","counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":15}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
