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

Complexity of a class of nonlinear combinatorial problems related to their linear counterparts

โœ Scribed by Suresh P. Sethi; Wieslaw Kubiak

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
429 KB
Volume
73
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A class of nonlinear time-delay systems
A class of nonlinear time-delay systems and related optimal problems
โœ R.T. Yanushevsky ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 336 KB

The method of synthesis for a class of time-delay nonlinear systems affine in control is considered. The proposed approach is based on the solution of a special optimal control problem. The integrand of the optimized functional is chosen in such a way that the Bellman equation has a desired solution

A problem of combinatorial designs relat
A problem of combinatorial designs related to authentication codes
โœ Dingyi Pei ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 433 KB ๐Ÿ‘ 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially