{"id":"https://openalex.org/W2083951446","doi":"https://doi.org/10.1145/2603088.2603121","title":"Faster decision of first-order graph properties","display_name":"Faster decision of first-order graph properties","publication_year":2014,"publication_date":"2014-07-14","ids":{"openalex":"https://openalex.org/W2083951446","doi":"https://doi.org/10.1145/2603088.2603121","mag":"2083951446"},"language":"en","primary_location":{"id":"doi:10.1145/2603088.2603121","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},"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/A5063871533","display_name":"Ryan Williams","orcid":"https://orcid.org/0000-0003-2326-2233"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ryan Williams","raw_affiliation_strings":["Stanford University"],"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063871533"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":2.1935,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.88044017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9983999729156494,"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/computer-science","display_name":"Computer science","score":0.6307370662689209},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5514218211174011},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5332989692687988},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5109843015670776},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47524285316467285},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4386640191078186},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.4158599376678467},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.394281804561615},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36012813448905945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3084088861942291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27594393491744995}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6307370662689209},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5514218211174011},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5332989692687988},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5109843015670776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47524285316467285},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4386640191078186},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.4158599376678467},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.394281804561615},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36012813448905945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3084088861942291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27594393491744995},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2603088.2603121","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2603088.2603121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W56839923","https://openalex.org/W70941151","https://openalex.org/W89448923","https://openalex.org/W104109059","https://openalex.org/W1570425181","https://openalex.org/W1576180980","https://openalex.org/W1604399776","https://openalex.org/W1787126581","https://openalex.org/W1968952709","https://openalex.org/W1973113631","https://openalex.org/W1985572324","https://openalex.org/W1989783863","https://openalex.org/W1995725694","https://openalex.org/W2012948111","https://openalex.org/W2028357390","https://openalex.org/W2033961328","https://openalex.org/W2038073775","https://openalex.org/W2047489708","https://openalex.org/W2059273723","https://openalex.org/W2066585576","https://openalex.org/W2078674325","https://openalex.org/W2089311600","https://openalex.org/W2113826940","https://openalex.org/W2114177725","https://openalex.org/W2119397055","https://openalex.org/W2130190334","https://openalex.org/W2139087151","https://openalex.org/W2146507303","https://openalex.org/W2206830592","https://openalex.org/W2264676752","https://openalex.org/W2951040528"],"related_works":["https://openalex.org/W2170725231","https://openalex.org/W961142965","https://openalex.org/W1589381382","https://openalex.org/W266537895","https://openalex.org/W4205729157","https://openalex.org/W3105069525","https://openalex.org/W1539117866","https://openalex.org/W2030312085","https://openalex.org/W2221885959","https://openalex.org/W2000611521"],"abstract_inverted_index":{"First-order":[0],"logic":[1],"captures":[2],"a":[3],"vast":[4],"number":[5],"of":[6,16],"computational":[7],"problems":[8],"on":[9,41,49],"graphs.":[10],"We":[11],"study":[12],"the":[13,47],"time":[14,40],"complexity":[15],"deciding":[17],"graph":[18],"properties":[19],"definable":[20],"by":[21],"first-order":[22],"sentences":[23],"in":[24,38],"prenex":[25],"normal":[26],"form":[27],"with":[28],"k":[29],"variables.":[30],"The":[31],"trivial":[32],"algorithm":[33],"for":[34],"this":[35],"problem":[36],"runs":[37],"O(nk)":[39],"n-node":[42],"graphs":[43],"(the":[44],"big-O":[45],"hides":[46],"dependence":[48],"k).":[50]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}