OpenAlex
Completeness for First-order Properties on Sparse Structures with Algorithmic Applications
Work
Year: 2018
Type: article
Abstract: Properties definable in first-order logic are algorithmically interesting for both theoretical and pragmatic reasons. Many of the most studied algorithmic problems, such as Hitting Set and Orthogonal ... more
Source: ACM Transactions on Algorithms
Authors Jiawei Gao, Russell Impagliazzo, Antonina Kolokolova, Ryan Williams
Institutions University of California, San Diego, Memorial University of Newfoundland, IIT@MIT
Cites: 26
Cited by: 12
Related to: 10
FWCI: 0.865
Citation percentile (by year/subfield): 91.73
Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
Funder National Science Foundation
Grant ID CCF-1213151, CCF-1552651 (CAREER)