1717 search results - page 246 / 344 » A Computable Spectral Theorem |
150
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
139
click to vote
CORR
2011
Springer
15 years 12 days ago
2011
Springer
— The Cartier-Perrin theorem, which was published in 1995 and is expressed in the language of nonstandard analysis, permits, for the first time perhaps, a clear-cut mathematical...
161
click to vote
IANDC
2011
15 years 11 days ago
2011
The present paper introduces a new model for teaching randomized learners. Our new model, though based on the classical teaching dimension model, allows to study the influence of...
178
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
118
click to vote
MLG
2007
Springer
15 years 11 months ago
2007
Springer
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...