{"id":"https://openalex.org/W1547393828","doi":"https://doi.org/10.1007/3-540-54487-9_68","title":"Nontrivial lower bounds for some NP-problems on directed graphs","display_name":"Nontrivial lower bounds for some NP-problems on directed graphs","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W1547393828","doi":"https://doi.org/10.1007/3-540-54487-9_68","mag":"1547393828"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-54487-9_68","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54487-9_68","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":"conference-paper","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/A5069000218","display_name":"Solomampionona Ranaivoson","orcid":null},"institutions":[{"id":"https://openalex.org/I98702875","display_name":"Universit\u00e9 de Caen Normandie","ror":"https://ror.org/051kpcy16","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I98702875"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Solomampionona Ranaivoson","raw_affiliation_strings":["Laboratoire d'Informatique de l'Universit\u00e9 de Caen, Caen cedex, France","Laboratoire d'Informatique de l'Universit\u00e9 de Caen"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique de l'Universit\u00e9 de Caen, Caen cedex, France","institution_ids":[]},{"raw_affiliation_string":"Laboratoire d'Informatique de l'Universit\u00e9 de Caen","institution_ids":["https://openalex.org/I98702875"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069000218"],"corresponding_institution_ids":["https://openalex.org/I98702875"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7796,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.64964249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"318","last_page":"339"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"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.9979000091552734,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.9958000183105469,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.7797567844390869},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7237991094589233},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6364755630493164},{"id":"https://openalex.org/keywords/np","display_name":"NP","score":0.5927916169166565},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5840990543365479},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5817333459854126},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5756940245628357},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.5617647171020508},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.5348739624023438},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49758628010749817},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48358243703842163},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45832645893096924},{"id":"https://openalex.org/keywords/p-versus-np-problem","display_name":"P versus NP problem","score":0.4543239176273346},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.43907925486564636},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.411738783121109},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2578771114349365},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.13442841172218323}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.7797567844390869},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7237991094589233},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6364755630493164},{"id":"https://openalex.org/C91331118","wikidata":"https://www.wikidata.org/wiki/Q628036","display_name":"NP","level":4,"score":0.5927916169166565},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5840990543365479},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5817333459854126},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5756940245628357},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.5617647171020508},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.5348739624023438},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49758628010749817},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48358243703842163},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45832645893096924},{"id":"https://openalex.org/C186861659","wikidata":"https://www.wikidata.org/wiki/Q746242","display_name":"P versus NP problem","level":3,"score":0.4543239176273346},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.43907925486564636},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.411738783121109},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2578771114349365},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.13442841172218323},{"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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-54487-9_68","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54487-9_68","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W34368311","https://openalex.org/W2011039300","https://openalex.org/W2045876200","https://openalex.org/W2057894153","https://openalex.org/W2082154422","https://openalex.org/W2098467469","https://openalex.org/W2117427692","https://openalex.org/W2125362004","https://openalex.org/W3152126650"],"related_works":["https://openalex.org/W2911941995","https://openalex.org/W2086059606","https://openalex.org/W2053392269","https://openalex.org/W2134140745","https://openalex.org/W1419862891","https://openalex.org/W2157910506","https://openalex.org/W1561713832","https://openalex.org/W2583420621","https://openalex.org/W2170767514","https://openalex.org/W1547393828"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}