Sciweavers

922 search results - page 12 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
FOGA
1994
13 years 9 months ago
The Schema Theorem and Price's Theorem
Holland's Schema Theorem is widely taken to be the foundation for explanations of the power of genetic algorithms (GAs). Yet some dissent has been expressed as to its implica...
Lee Altenberg
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
FSS
2010
86views more  FSS 2010»
13 years 5 months ago
Compactification of lattice-valued convergence spaces
: We define compactness for stratified lattice-valued convergence spaces and show that a Tychonoff theorem is true. Further a generalization of the classical Richardson compactific...
Gunther Jäger
CIE
2010
Springer
14 years 14 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...
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 5 months ago
From Holant To #CSP And Back: Dichotomy For Holant$^c$ Problems
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
Jin-yi Cai, Sangxia Huang, Pinyan Lu