Algebra grammars
Algebra of Polynomially Bounded Sequences and Negligible Functions
In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation between polynomially...
Algebraic analysis of LPC+Ch calculus
Algebraic and graph-theoretic properties of infinite -posets
A -labeled -poset is an (at most) countable set, labeled in the set , equipped with partial orders. The collection of all -labeled -posets is naturally equipped with binary product operations and -ary product operations. Moreover, the -ary product operations give rise to
Algebraic and graph-theoretic properties of infinite n-posets
A Σ-labeled n-poset is an (at most) countable set, labeled in the set Σ, equipped with n partial orders. The collection of all Σ-labeled n-posets is naturally equipped with n binary product operations and nω-ary product operations. Moreover, the ω-ary product operations give rise to nω-power operations. We show that those Σ-labeled n-posets that can be generated from the singletons by the binary and ω-ary product operations form the free algebra on Σ in a variety axiomatizable by an infinite collection...
Algebraic and topological theory of languages
Algebraic caractérisations of NTIME and NTIME
Algebraic complexity of path problems
Algebraic complexity theory. I: An introduction. (Algebraische Komplexitätstheorie. I: Eine Einführung.)
Algebraic complexity theory. II: Tast matrix multiplication and combinatorics. (Algebraische Komplexitätstheorie. II: Schnelle Matrixmultiplikation und Kombinatorik.)
Algebraic complexity theory. III: On the complexity of the computation of permanents. (Algebraische Komplexitätstheorie. III: Zur Berechnungskomplexität von Permanenten.)
Algebraic definition of a functional programming language and its semantic models
Algebraic elimination of -transitions.
Algebraic representation formulas for null curves in Sl(2,ℂ)
We study curves in Sl(2,ℂ) whose tangent vectors have vanishing length with respect to the biinvariant conformal metric induced by the Killing form, so-called null curves. We establish differential invariants of them that resemble infinitesimal arc length, curvature and torsion of ordinary curves in Euclidean 3-space. We discuss various differential-algebraic representation formulas for null curves. One of them, a modification of the Bianchi-Small formula, gives an Sl(2,ℂ)-equivariant bijection...
Algebraical loops and transformation of variables
Algèbres effectives dans la programmation logique avec contraintes
Algèbres non déterministiques et -catégories
Algorithm 25. Discrete optimization by the method of Mao and Wallingford
Algorithm 26. Limit distribution of the number of items in the queueing system E₂/E₂/n
Algorithm 27. Statistical prediction by the method of harmonical weights