37 search results - page 5 / 8 » The Complexity of Orbits of Computably Enumerable Sets |
CPC
2004
13 years 7 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
COLT
2003
Springer
14 years 21 days ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
ESANN
2006
13 years 8 months ago
2006
It has been proposed that chaos can serve as a reservoir providing an infinite number of dynamical states [1, 2, 3, 4, 5]. These can be interpreted as different behaviors, search a...
ECCC
2006
13 years 7 months ago
2006
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
PVLDB
2008
13 years 7 months ago
2008
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...