✦ LIBER ✦

Lower bounds for the ranks of CM types

✍ Scribed by Liem Mai

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 396 KB
Volume: 32
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(89)90025-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for certain types of van de

Lower bounds for certain types of van der Waerden numbers

✍ H.L Abbott; D Hanson 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 164 KB

A lower bound for the crossing number of

A lower bound for the crossing number of Cm × Cn

✍ Gelasio Salazar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 3 views

Bounds on the ranks of some 3-tensors

✍ M.D. Atkinson; S. Lloyd 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 778 KB

Lower bounds for the complexity of polyn

Lower bounds for the complexity of polynomials

✍ Hans-Jörg Stoß 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Lower bounds for the average genus

✍ Jianer Chen; Jonathan L. Gross; Robert G. Rieper 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

Two lower bounds are obtained for the average genus of graphs. The average genus for a graph of maximum valence at most 3 is at least half its maximum genus, and the average genus for a 2-connected simplicial graph other than a cycle is at least 1/16 of its cycle rank.

Lower bounds for the approximative compl

Lower bounds for the approximative complexity

✍ Bernhard Griesser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 440 KB