855 search results - page 11 / 171 » Complexity of Equations over Sets of Natural Numbers |
CADE
2008
Springer
15 years 10 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
JCT
2007
14 years 9 months ago
2007
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
CRV
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...