VC-dimension of short Presburger formulas

10/11/2017
by   Danny Nguyen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2021

Characterizing Tseitin-formulas with short regular resolution refutations

Tseitin-formulas are systems of parity constraints whose structure is de...
research
07/13/2023

Short Boolean Formulas as Explanations in Practice

We investigate explainability via short Boolean formulas in the data mod...
research
04/10/2023

Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields

This work provides refined polynomial upper bounds for the condition num...
research
09/04/2023

On the size of irredundant propagation complete CNF formulas

We investigate propagation complete (PC) CNF formulas for a symmetric de...
research
07/04/2018

A complete system of deduction for Sigma formulas

The Sigma formulas of the language of arithmetic express semidecidable r...
research
07/07/2020

Near-tight closure bounds for Littlestone and threshold dimensions

We study closure properties for the Littlestone and threshold dimensions...
research
05/03/2023

Short definitions in constraint languages

A first-order formula is called primitive positive (pp) if it only admit...

Please sign up or login with your details

Forgot password? Click here to reset