Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Fourth Petrozavodsk Conference ‘Probabilistic Methods in Discrete Mathematics’
-
V. F. Kolchin
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1997
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- On the complexity and depth of circuits that realize partial Boolean functions
- On some properties of algebras with simple multiplication containing associative subalgebras
- On the structure of the lattice of closed classes of polynomials
- Codes and designs
- On the minimal packing of a tree with fixed vertices
- Characterization of some extremal graphs with diameter no greater than three
- On the traversal of labyrinths by automata leaving unremovable labels
- Approximate models of permutational automata
- Limit theorems for the number of empty cells
- Fourth Petrozavodsk Conference ‘Probabilistic Methods in Discrete Mathematics’
Artikel in diesem Heft
- On the complexity and depth of circuits that realize partial Boolean functions
- On some properties of algebras with simple multiplication containing associative subalgebras
- On the structure of the lattice of closed classes of polynomials
- Codes and designs
- On the minimal packing of a tree with fixed vertices
- Characterization of some extremal graphs with diameter no greater than three
- On the traversal of labyrinths by automata leaving unremovable labels
- Approximate models of permutational automata
- Limit theorems for the number of empty cells
- Fourth Petrozavodsk Conference ‘Probabilistic Methods in Discrete Mathematics’
