13603 search results - page 366 / 2721 » On the Computational Complexity of Cut-Reduction |
166
click to vote
AAECC
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We review a binary sequence based on the generalized cyclotomy of order 2 with respect to p3 , where p is an odd prime. Linear complexities, minimal polynomials and autoc...
186
click to vote
FCT
2007
Springer
16 years 1 months ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
202
click to vote
MLG
2007
Springer
16 years 1 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
180
click to vote
ALT
2005
Springer
16 years 4 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
194
click to vote
PODC
2005
ACM
16 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...