1399 search results - page 187 / 280 » Multi-party Finite Computations |
108
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
125
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
144
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
118
click to vote
AUTOMATICA
2006
15 years 4 months ago
2006
A block Toeplitz algorithm is proposed to perform the J-spectral factorization of a para-Hermitian polynomial matrix. The input matrix can be singular or indefinite, and it can ha...
136
click to vote
FMSD
2008
15 years 4 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...