220 search results - page 36 / 44 » tcs 2008 |
TCS
2008
13 years 5 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
TCS
2008
13 years 5 months ago
2008
Density elimination, a close relative of cut elimination, consists of removing applications of the Takeuti-Titani density rule from derivations in Gentzen-style (hypersequent) cal...
TCS
2008
13 years 5 months ago
2008
Filling operations are procedures which are used in Discrete Tomography for the reconstruction of lattice sets having some convexity constraints. Many algorithms have been publish...
TCS
2008
13 years 5 months ago
2008
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we...
TCS
2008
13 years 5 months ago
2008
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...