Sciweavers

922 search results - page 5 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
COLT
2001
Springer
13 years 12 months ago
A Generalized Representer Theorem
Bernhard Schölkopf, Ralf Herbrich, Alex J. Sm...
JCSS
1998
74views more  JCSS 1998»
13 years 7 months ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich
CIE
2010
Springer
14 years 6 days ago
Ergodic-Type Characterizations of Algorithmic Randomness
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...
EJC
2006
13 years 7 months ago
An iterative-bijective approach to generalizations of Schur's theorem
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...
Sylvie Corteel, Jeremy Lovejoy