212 search results - page 1 / 43 » Complexity Parameters for First-Order Classes |
ILP
2003
Springer
13 years 9 months ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
SIAMIS
2010
12 years 11 months ago
2010
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
LICS
2000
IEEE
13 years 9 months ago
2000
IEEE
We establish that the decidability of the first order theory of a class of finite structures ¢ is a simple and useful condition for guaranteeing that the expressive power of FO...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
STACS
1993
Springer
13 years 8 months ago
1993
Springer
We show that for most complexity classes of interest, all sets complete under rstorder projections (fops) are isomorphic under rst-order isomorphisms. That is, a very restricted v...