{"id":"https://openalex.org/W266537895","doi":"https://doi.org/10.1007/3-540-10003-2_81","title":"The complexity of semilinear sets","display_name":"The complexity of semilinear sets","publication_year":1980,"publication_date":"1980-01-01","ids":{"openalex":"https://openalex.org/W266537895","doi":"https://doi.org/10.1007/3-540-10003-2_81","mag":"266537895"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-10003-2_81","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-10003-2_81","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"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/A5079124765","display_name":"Thiet-Dung Huynh","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thiet-Dung Huynh","raw_affiliation_strings":["Fachbereich Informatik, Universit\u00e4t Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Informatik, Universit\u00e4t Saarbr\u00fccken, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079124765"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.9343,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.73572377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"18","issue":null,"first_page":"324","last_page":"337"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9779999852180481,"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.9779999852180481,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9653000235557556,"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.9587000012397766,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7387763261795044},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.7192137837409973},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.7139856219291687},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.7073756456375122},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.6644852161407471},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6496105194091797},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6259102821350098},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5987789630889893},{"id":"https://openalex.org/keywords/computational-problem","display_name":"Computational problem","score":0.5524711012840271},{"id":"https://openalex.org/keywords/word-problem","display_name":"Word problem (mathematics education)","score":0.4921392798423767},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.4460919499397278},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.4451439082622528},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4430946409702301},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.4208545684814453},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4150148630142212},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3986215591430664},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3171149492263794},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23642998933792114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21676477789878845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11741945147514343},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10073071718215942}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7387763261795044},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.7192137837409973},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.7139856219291687},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.7073756456375122},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.6644852161407471},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6496105194091797},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6259102821350098},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5987789630889893},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.5524711012840271},{"id":"https://openalex.org/C90988201","wikidata":"https://www.wikidata.org/wiki/Q255912","display_name":"Word problem (mathematics education)","level":2,"score":0.4921392798423767},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4460919499397278},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.4451439082622528},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4430946409702301},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.4208545684814453},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4150148630142212},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3986215591430664},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3171149492263794},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23642998933792114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21676477789878845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11741945147514343},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10073071718215942},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-10003-2_81","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-10003-2_81","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:hdl:10068/182550","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/182550","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"},{"id":"mag:266537895","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eik/eik18.html#Huynh82","pdf_url":null,"source":{"id":"https://openalex.org/S62907800","display_name":"Journal of automata, languages and combinatorics","issn_l":"1430-189X","issn":["1430-189X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310313929","host_organization_name":"University of Giessen","host_organization_lineage":["https://openalex.org/P4310313929"],"host_organization_lineage_names":["University of Giessen"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of automata, languages and combinatorics","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5699999928474426}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W118954745","https://openalex.org/W1494436834","https://openalex.org/W1971435636","https://openalex.org/W1989146600","https://openalex.org/W1996184580","https://openalex.org/W1998084650","https://openalex.org/W2065251436","https://openalex.org/W2071228820","https://openalex.org/W6658731649"],"related_works":["https://openalex.org/W1589381382","https://openalex.org/W2164003033","https://openalex.org/W2065251436","https://openalex.org/W2017315323","https://openalex.org/W1970398023","https://openalex.org/W2162339458","https://openalex.org/W2089970856","https://openalex.org/W2054667934","https://openalex.org/W2013504313","https://openalex.org/W2008435081","https://openalex.org/W2001068306","https://openalex.org/W1973458874","https://openalex.org/W1971231744","https://openalex.org/W1970896297","https://openalex.org/W1966992415","https://openalex.org/W2106001218","https://openalex.org/W2021009590","https://openalex.org/W1975261774","https://openalex.org/W2033117827","https://openalex.org/W56713903"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}