Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications

Abstract

Properties definable in first-order logic are algorithmically<lb>interesting for both theoretical and pragmatic reasons.<lb>Many of the most studied algorithmic problems, such<lb>as Hitting Set and Orthogonal Vectors, are first-order,<lb>and the first-order properties naturally arise as relational<lb>database queries. A relatively straight-forward determin… (More)

Topics

5 Figures and Tables

Statistics

020406020162017
Citations per Year

Citation Velocity: 17

Averaging 17 citations per year over the last 2 years.

Learn more about how we calculate this metric in our FAQ.