Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the circle method
-
S. M. VORONIN
Veröffentlicht/Copyright:
8. Oktober 2009
Published Online: 2009-10-08
Published in Print: 1991
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- The Newton sums method in combinatorial optimization
- Kerdock code in a cyclic form
- On the conditions of regularity for finite autonomous automata
- On lower bounds for the time of computation
- Stochasticity of the languages acceptable by two-way finite probabilistic automata
- On completeness of the binary boundedly determined functions with respect to superposition
- Weighings, allocations, and the embeddability of partitions
- On the circle method
- Distribution of the permanent of a random Boolean matrix
Artikel in diesem Heft
- The Newton sums method in combinatorial optimization
- Kerdock code in a cyclic form
- On the conditions of regularity for finite autonomous automata
- On lower bounds for the time of computation
- Stochasticity of the languages acceptable by two-way finite probabilistic automata
- On completeness of the binary boundedly determined functions with respect to superposition
- Weighings, allocations, and the embeddability of partitions
- On the circle method
- Distribution of the permanent of a random Boolean matrix
