Sciweavers

13603 search results - page 138 / 2721
» On the Complexity of Computing Treelength
Sort
View
SAGA
2007
Springer
14 years 3 months ago
On Computation and Communication with Small Bias
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
Harry Buhrman
MCU
2007
95views Hardware» more  MCU 2007»
13 years 11 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud