{"id":"https://openalex.org/W1530851674","doi":"https://doi.org/10.1007/978-3-662-49674-9_42","title":"PTIME Computation of Transitive Closures of Octagonal Relations","display_name":"PTIME Computation of Transitive Closures of Octagonal Relations","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W1530851674","doi":"https://doi.org/10.1007/978-3-662-49674-9_42","mag":"1530851674"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-49674-9_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-49674-9_42","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":"book-chapter","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/A5044924272","display_name":"Filip Kone\u010dn\u00fd","orcid":"https://orcid.org/0000-0001-5930-8040"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Filip Kone\u010dn\u00fd","raw_affiliation_strings":["Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Brno, Czech Republic","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044924272"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0023,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83523207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"645","last_page":"661"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987000226974487,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9965000152587891,"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/T11567","display_name":"semigroups and automata theory","score":0.9922000169754028,"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/transitive-closure","display_name":"Transitive closure","score":0.9183835983276367},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.8505517244338989},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.8167212009429932},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.8035067319869995},{"id":"https://openalex.org/keywords/exptime","display_name":"EXPTIME","score":0.7919027805328369},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.6549087166786194},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5438516736030579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5018520355224609},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4812481105327606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47911834716796875},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47783899307250977},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.44591453671455383},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41275760531425476},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3955892324447632},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3368862271308899},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.33643943071365356},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3133707344532013},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.21622949838638306},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.171968013048172},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.16540038585662842},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1401527225971222},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1086152195930481},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06388133764266968}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.9183835983276367},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.8505517244338989},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.8167212009429932},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.8035067319869995},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.7919027805328369},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.6549087166786194},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5438516736030579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5018520355224609},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4812481105327606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47911834716796875},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47783899307250977},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.44591453671455383},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41275760531425476},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3955892324447632},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3368862271308899},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.33643943071365356},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3133707344532013},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.21622949838638306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.171968013048172},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.16540038585662842},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1401527225971222},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1086152195930481},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06388133764266968},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-49674-9_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-49674-9_42","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:oai:CiteSeerX.psu:10.1.1.760.7384","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.760.7384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1402.2102.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W89892127","https://openalex.org/W1489033561","https://openalex.org/W1518101386","https://openalex.org/W1532358383","https://openalex.org/W1540580590","https://openalex.org/W1544283013","https://openalex.org/W2132083063","https://openalex.org/W2911612809","https://openalex.org/W2911894214","https://openalex.org/W2950560670","https://openalex.org/W3022499156","https://openalex.org/W3105212949","https://openalex.org/W3158747708","https://openalex.org/W4214650869"],"related_works":["https://openalex.org/W2075704325","https://openalex.org/W1553139688","https://openalex.org/W1503149859","https://openalex.org/W2008080405","https://openalex.org/W4366828350","https://openalex.org/W2038086027","https://openalex.org/W2362009423","https://openalex.org/W4296464145","https://openalex.org/W1530851674","https://openalex.org/W2949141320"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}