VC-dimension of short Presburger formulas
Logic
2017-10-12 v1 Logic in Computer Science
Combinatorics
Abstract
We study VC-dimension of short formulas in Presburger Arithmetic, defined to have a bounded number of variables, quantifiers and atoms. We give both lower and upper bounds, which are tight up to a polynomial factor in the bit length of the formula.
Keywords
Cite
@article{arxiv.1710.04171,
title = {VC-dimension of short Presburger formulas},
author = {Danny Nguyen and Igor Pak},
journal= {arXiv preprint arXiv:1710.04171},
year = {2017}
}