On-line evaluation of powers using Euclid's algorithm
Srećko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Efficient computation of addition chains”
On-line evaluation of powers using Euclid's algorithm
On strong chain recurrence for maps
Katsuya Yokoi (2015)
Annales Polonici Mathematici
Similarity:
This paper is concerned with strong chain recurrence introduced by Easton. We investigate the depth of the transfinite sequence of nested, closed invariant sets obtained by iterating the process of taking strong chain recurrent points, which is a related form of the central sequence due to Birkhoff. We also note the existence of a Lyapunov function which is decreasing off the strong chain recurrent set. As an application, we give a necessary and sufficient condition for the coincidence...
Note on normal sequences of chain complexes
Klaus Heiner Kamps (1978)
Colloquium Mathematicae
Similarity:
On some method for diagnosing convergence in MCMC setups via atoms and renewal sets
Maciej Romaniuk (2007)
Control and Cybernetics
Similarity:
Set families with a forbidden subposet.
Bukh, Boris (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Davenport's constant for indefinite binary quadratic forms
Jane Pitman (1960)
Acta Arithmetica
Similarity:
On The Use Of Structural Formulae Of Kinematic Chains
Marko D. Lekop (1973)
Publications de l'Institut Mathématique
Similarity:
Chains in modular ternary latticoids
Jarmila Hedlíková (1977)
Mathematica Slovaca
Similarity:
Chain-finite operators and locally chain-finite operators.
Teresa Bermúdez, Antonio Martinón (1999)
Extracta Mathematicae
Similarity:
The problem we are concerned with in this research announcement is the algebraic characterization of chain-finite operators (global case) and of locally chain-finite operators (local case).