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

Shortest consistent superstrings computable in polynomial time

โœ Scribed by Tao Jiang; Vadim G. Timkovsky

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
649 KB
Volume
143
Category
Article
ISSN
0304-3975

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

The neighbour-scattering number can be c
The neighbour-scattering number can be computed in polynomial time for interval graphs
โœ Fengwei Li; Xueliang Li ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 259 KB

Neighbour-scattering number is a useful measure for graph vulnerability. For some special kinds of graphs, explicit formulas are given for this number. However, for general graphs it is shown that to compute this number is NP-complete. In this paper, we prove that for interval graphs this number can