698 search results - page 70 / 140 » dagstuhl 2007 |
79
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
76
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
We consider the problem of a searcher that looks for a lost flashlight in a dusty environment. The search agent finds the flashlight as soon as it crosses the ray emanating from t...
100
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
89
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
We present and relate recent results in prediction based on countable classes of either probability (semi-)distributions or base predictors. Learning by Bayes, MDL, and stochastic ...
79
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...