Article
Licensed
Unlicensed
Requires Authentication
Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
-
B. A. Sevastyanov
Published/Copyright:
October 18, 2010
Abstract
We suggest an algorithm calculating the limit probabilities

of the distribution of the permanent of a random matrix Amn = ‖αij‖ with m rows and n independent columns over the field GF(p).
Received: 2010-03-25
Published Online: 2010-10-18
Published in Print: 2010-October
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata
Articles in the same Issue
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata