Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On the complexity of finding the number of solutions of systems of Boolean equations
-
S. P. GORSHKOV
Veröffentlicht/Copyright:
9. Oktober 2009
Published Online: 2009-10-09
Published in Print: 1996
Walter de Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Statistical estimation of the structure of a finite population
- The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent
- On some algebras connected with fast algorithms
- On computing logarithms on elliptic curves
- On the complexity of finding the number of solutions of systems of Boolean equations
- A criterion of completeness for non-homogeneous functions with delays
Artikel in diesem Heft
- Statistical estimation of the structure of a finite population
- The numbers of ascending segments in a random permutation and in the inverse to it are asymptotically independent
- On some algebras connected with fast algorithms
- On computing logarithms on elliptic curves
- On the complexity of finding the number of solutions of systems of Boolean equations
- A criterion of completeness for non-homogeneous functions with delays
