๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing the optimal IO sequences of a protocol in polynomial time

โœ Scribed by Wen-Huei Chen; Chuan Yi Tang

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
453 KB
Volume
40
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Polynomial-Time Computation of the Dimen
Polynomial-Time Computation of the Dimension of Algebraic Varieties in Zero-Characteristic
โœ ALEXANDER L. CHISTOV ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 772 KB

In this paper an algorithm is described for the computation of the dimension of a projective algebraic variety over a zero characteristic ground field. The variety is given as a set of zeros of a family of homogeneous polynomials of the degree less than d in n + 1 variables. The working time of the

A Classification of Linear Time-Optimal
A Classification of Linear Time-Optimal Control Problems in a Neighborhood of the Origin
โœ G.M. Sklyar; S.Yu. Ignatovich ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 236 KB

The main goal of the paper is to classify time-optimal control problems for linear controllable systems with analytic coefficients. The reduction to the Markov moment min-problem is the main tool of this investigation. The constructive solution of the time-optimal control problem using mentioned red