𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of the Syracuse algorithm in Fq[x]

✍ Scribed by K.R Matthews; G.M Leigh

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
181 KB
Volume
25
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A projective invariant generalization of
A projective invariant generalization of the de Casteljau algorithm
✍ J. BenΓ­tez πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 404 KB

## a b s t r a c t A projective invariant generalization of the de Casteljau algorithm is described by using the cross ratio and an auxiliary line. We describe the implicit form of the section conics obtained by the algorithm proposed in this paper. Finally, we show how to construct specific conic

A generalization of the algorithm of Hei
A generalization of the algorithm of Heidtmann to non-monotone formulas
✍ R. Bertschy; P.A. Monney πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 993 KB

The following problem from reliability theory is considered. Given a disjunctive normal form (DNF) ~0 = ~ol v ... v ~or, we want to find a representation of ~0 into disjoint formulas, i.e. find formulas th,..., qs such that q~ = ql v .-. v q~ and t/i/x r b = \_1\_ whenever i Β’j. In addition, the for

An Incremental Algorithm for a Generaliz
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
✍ G. Ramalingam; Thomas Reps πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 363 KB

The grammar problem, a generalization of the single-source shortest-path prob-Ž Ž . Ž . . lem introduced by D. E. Knuth Inform. Process. Lett. 6 1 1977 , 1᎐5 is to compute the minimum-cost derivation of a terminal string from each nonterminal of a given context-free grammar, with the cost of a deriv