{"id":"https://openalex.org/W109561861","doi":null,"title":"Compilation of Intractable Problems and Its Application to Artificial Intelligence","display_name":"Compilation of Intractable Problems and Its Application to Artificial Intelligence","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W109561861","mag":"109561861"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.485","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.485","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dis.uniroma1.it/~liberato/papers/libe-98-c.pdf","raw_type":"text"},"volume":null,"type":"article","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/A5008581096","display_name":"Paolo Liberatore","orcid":"https://orcid.org/0000-0001-5355-3766","observed_orcids":["https://orcid.org/0000-0001-5355-3766"]},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Paolo Liberatore","raw_affiliation_strings":["Sapienza, university of Rome"],"raw_orcid":"https://orcid.org/0000-0001-5355-3766","affiliations":[{"raw_affiliation_string":"Sapienza, university of Rome","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008581096"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.788100004196167,"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.788100004196167,"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.1736000031232834,"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.012000000104308128,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/intractable-problems","display_name":"intractable problems","score":0.9129999876022339},{"id":"https://openalex.org/keywords/compilation","display_name":"compilation","score":0.5239999890327454},{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","score":0.7210000157356262},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"parameterized complexity","score":0.7239999771118164},{"id":"https://openalex.org/keywords/np-hard-problems","display_name":"NP-hard problems","score":0.6650000214576721},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.5059999823570251},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.49000000953674316},{"id":"https://openalex.org/keywords/language-restrictions","display_name":"language restrictions","score":0.6019999980926514}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.59076327085495},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5074262022972107},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.4899227023124695},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.47776925563812256},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4426831007003784},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4284578263759613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4057336151599884},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3633540868759155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3194665312767029},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19454258680343628},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.485","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.485","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dis.uniroma1.it/~liberato/papers/libe-98-c.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.45.6767","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.6767","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.dis.uniroma1.it/pub/ai/papers/libe-98-c.ps.gz","raw_type":"text"},{"id":"mag:109561861","doi":null,"is_oa":false,"landing_page_url":"http://www.dis.uniroma1.it/~liberato/papers/libe-98-c.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W2666015","https://openalex.org/W8785928","https://openalex.org/W22705001","https://openalex.org/W54673468","https://openalex.org/W68974267","https://openalex.org/W81942528","https://openalex.org/W84120850","https://openalex.org/W92428305","https://openalex.org/W111945848","https://openalex.org/W116450752","https://openalex.org/W128812405","https://openalex.org/W137603104","https://openalex.org/W164606784","https://openalex.org/W175768675","https://openalex.org/W178964078","https://openalex.org/W183418742","https://openalex.org/W205822604","https://openalex.org/W1216620507","https://openalex.org/W1505432843","https://openalex.org/W1540422960","https://openalex.org/W1543451444","https://openalex.org/W1575886793","https://openalex.org/W1593890373","https://openalex.org/W1598141101","https://openalex.org/W1784873952","https://openalex.org/W1883191840","https://openalex.org/W1970089350","https://openalex.org/W1975442866","https://openalex.org/W1982345710","https://openalex.org/W1986602165","https://openalex.org/W1989492347","https://openalex.org/W1993512664","https://openalex.org/W2007457223","https://openalex.org/W2008294142","https://openalex.org/W2011039300","https://openalex.org/W2011992362","https://openalex.org/W2022841964","https://openalex.org/W2023141722","https://openalex.org/W2024971746","https://openalex.org/W2036900631","https://openalex.org/W2057052228","https://openalex.org/W2067590843","https://openalex.org/W2083568285","https://openalex.org/W2085022454","https://openalex.org/W2088631785","https://openalex.org/W2124299249","https://openalex.org/W2129345658","https://openalex.org/W2138162238","https://openalex.org/W2138359650","https://openalex.org/W2146394036","https://openalex.org/W2149420462","https://openalex.org/W2155322595","https://openalex.org/W2159800242","https://openalex.org/W2160579271","https://openalex.org/W2575431418","https://openalex.org/W2891212941","https://openalex.org/W2945259913"],"related_works":["https://openalex.org/W1972826134","https://openalex.org/W2085393535","https://openalex.org/W2155102678","https://openalex.org/W6922531779","https://openalex.org/W7100065139","https://openalex.org/W2115500582","https://openalex.org/W83192606","https://openalex.org/W1981526513","https://openalex.org/W1993656429","https://openalex.org/W2533262985"],"abstract_inverted_index":{"Intractable":[0],"problems":[1],"are":[2,22],"hard":[3],"to":[4,10,33,48,123,171],"solve.":[5],"Since":[6],"the":[7,23,27,68,101,109,112,125,132,145,150,155,158,167],"work":[8],"\"has":[9],"be":[11,54,162,172],"done\",":[12],"various":[13],"solutions":[14],"have":[15,40,72],"been":[16],"developed.":[17],"The":[18,29,44,64],"two":[19,97,128],"classical":[20],"ones":[21],"language":[24],"restriction":[25],"and":[26,135,149,153],"approximation.":[28],"first":[30],"solution":[31,51],"is":[32,47,67,82,94,104,122,169],"admit":[34],"input":[35],"strings":[36],"only":[37,115],"if":[38],"they":[39],"a":[41,50,77,139],"certain":[42],"form.":[43],"second":[45,159],"one":[46,99],"find":[49],"that":[52],"can":[53,161],"sometimes":[55],"incorrect.":[56],"In":[57],"this":[58,92],"dissertation":[59],"we":[60,71],"concentrate":[61],"on":[62],"compilation.":[63],"basic":[65],"scenario":[66],"following":[69],"one:":[70],"an":[73],"intractable":[74],"problem,":[75],"thus":[76],"problem":[78,93,126,168],"for":[79],"which":[80],"it":[81,137],"believed":[83],"no":[84],"polynomial":[85,165],"algorithm":[86],"exists.":[87],"However,":[88],"each":[89],"instance":[90],"of":[91,96],"composed":[95],"parts,":[98],"(called":[100,111],"fixed":[102,133],"part":[103,134],"known":[105],"in":[106,127,164],"advance,":[107],"while":[108],"other":[110],"varying":[113,151],"part)":[114],"comes":[116],"at":[117],"execution":[118],"time.":[119],"Our":[120],"idea":[121],"solve":[124],"steps:":[129],"1.":[130],"Take":[131,144],"compile":[136],"into":[138],"new":[140,146],"data":[141,147],"structure;":[142],"2.":[143],"structure":[148],"part,":[152],"produce":[154],"output.":[156],"If":[157],"step":[160],"accomplished":[163],"time,":[166],"said":[170],"compil...":[173]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-06-24T00:00:00"}