11151 search results - page 240 / 2231 » On the Complexity of Model Expansion |
158
click to vote
IFIP
2004
Springer
16 years 18 days ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
160
click to vote
PATMOS
2004
Springer
16 years 18 days ago
2004
Springer
Abstract. An extensible and configurable processor is a programmable platform offering the possibility to customize the instruction set and/or underlying microarchitecture. Efficie...
164
click to vote
ILP
2003
Springer
16 years 13 days ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
182
click to vote
FAW
2009
Springer
15 years 12 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
177
click to vote
SSS
2009
Springer
15 years 11 months ago
2009
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...