13603 search results - page 329 / 2721 » On the Computational Complexity of Cut-Reduction |
183
Voted
CEC
2005
IEEE
16 years 1 months ago
2005
IEEE
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
172
Voted
DGCI
2005
Springer
16 years 1 months ago
2005
Springer
Due to the restriction of SIMD mode to local operations in VLSI massively parallel vision chips, using programmable connections and asynchronous communications are key ingredients ...
164
click to vote
FCT
2005
Springer
16 years 1 months ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
196
Voted
DCC
2006
IEEE
16 years 7 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
221
click to vote
FCT
2005
Springer
16 years 27 days ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...