{"id":"https://openalex.org/W3035315564","doi":"https://doi.org/10.1007/978-3-662-59362-2_3","title":"$$ \\mathcal{NP} $$ -complete problems","display_name":"$$ \\mathcal{NP} $$ -complete problems","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3035315564","doi":"https://doi.org/10.1007/978-3-662-59362-2_3","mag":"3035315564"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-59362-2_3","doi":"https://doi.org/10.1007/978-3-662-59362-2_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-59362-2_3","pdf_url":null,"source":{"id":"https://openalex.org/S4210185413","display_name":"Monographs in theoretical computer science","issn_l":"1431-2654","issn":["1431-2654","2193-2069"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Monographs in Theoretical Computer Science. An EATCS Series","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W3034470636","display_name":"Models and Algorithms of Time-Dependent Scheduling"},"type":"book-chapter","is_traditional":true,"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/A5004789642","display_name":"Stanis\u0142aw Gawiejnowicz","orcid":"https://orcid.org/0000-0002-1648-6987","observed_orcids":["https://orcid.org/0000-0002-1648-6987"]},"institutions":[{"id":"https://openalex.org/I59411706","display_name":"Adam Mickiewicz University in Pozna\u0144","ror":"https://ror.org/04g6bbq64","country_code":"PL","type":"education","lineage":["https://openalex.org/I59411706"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Stanis\u0142aw Gawiejnowicz","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Adam Mickiewicz University in Pozna\u0144, Pozna\u0144, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Adam Mickiewicz University in Pozna\u0144, Pozna\u0144, Poland","institution_ids":["https://openalex.org/I59411706"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004789642"],"corresponding_institution_ids":["https://openalex.org/I59411706"],"apc_list":null,"apc_paid":null,"fwci":0.9276,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71722365,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9491999745368958,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9491999745368958,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.041999999433755875,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.0017999999690800905,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.9700000286102295},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.9179999828338623},{"id":"https://openalex.org/keywords/scheduling-theory","display_name":"scheduling theory","score":0.7799999713897705},{"id":"https://openalex.org/keywords/complexity-classes","display_name":"complexity classes","score":0.6690000295639038},{"id":"https://openalex.org/keywords/polynomial-time-reduction","display_name":"polynomial-time reduction","score":0.5860000252723694}],"concepts":[{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.7086285948753357},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.507506787776947},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4192996025085449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4030894637107849},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.11946821212768555}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-662-59362-2_3","doi":"https://doi.org/10.1007/978-3-662-59362-2_3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-59362-2_3","pdf_url":null,"source":{"id":"https://openalex.org/S4210185413","display_name":"Monographs in theoretical computer science","issn_l":"1431-2654","issn":["1431-2654","2193-2069"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Monographs in Theoretical Computer Science. An EATCS Series","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2418510496","https://openalex.org/W4388878222","https://openalex.org/W43980304","https://openalex.org/W2780620632","https://openalex.org/W22300245","https://openalex.org/W3035072956","https://openalex.org/W2057392949","https://openalex.org/W2150446509","https://openalex.org/W2743045177","https://openalex.org/W7097694958"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2020-06-19T00:00:00"}