𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New upper bounds on the linear complexity

✍ Scribed by P. Caballero-Gil

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
478 KB
Volume
39
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New upper bounds on harmonious colorings
New upper bounds on harmonious colorings
✍ Keith Edwards; Colin McDiarmid πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 435 KB

## Abstract We present an improved upper bound on the harmonious chromatic number of an arbitrary graph. We also consider β€žfragmentable”︁ classes of graphs (an example is the class of planar graphs) that are, roughly speaking, graphs that can be decomposed into bounded‐sized components by removing

New upper bounds on Zagreb indices
New upper bounds on Zagreb indices
✍ Kinkar Ch. Das; Ivan Gutman; Bo Zhou πŸ“‚ Article πŸ“… 2008 πŸ› Springer 🌐 English βš– 140 KB
Upper Bounds on Permutation Codes via Li
Upper Bounds on Permutation Codes via Linear Programming
✍ H. Tarnanen πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 140 KB

An upper bound on permutation codes of length n is given. This bound is a solution of a certain linear programming problem and is based on the well-developed theory of association schemes. Several examples are presented. For instance, the 255 values of the bound for n ≀ 8 are tabulated. It turns out

New upper bounds on the decomposability
New upper bounds on the decomposability of planar graphs
✍ Fedor V. Fomin; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 335 KB πŸ‘ 1 views

## Abstract It is known that a planar graph on __n__ vertices has branch‐width/tree‐width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant Ξ±. We give a proof of the best, so far, upper bound for the constant Ξ±. In particular, for th