4218 search results - page 201 / 844 » Complete sets of cooperations |
COMBINATORICS
2006
15 years 22 days ago
2006
Existing tables of constant weight codes are mainly confined to codes of length n 28. This paper presents tables of codes of lengths 29 n 63. The motivation for creating these ...
ENTCS
2006
15 years 21 days ago
2006
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
98
Voted
GC
2006
Springer
15 years 20 days ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
86
Voted
PR
2000
15 years 13 days ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...
112
click to vote
MCU
2004
15 years 2 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...