Counting k-sumsets in groups of prime order

Articles in the same Issue

1. Masthead
2. On stability of a vector Boolean investment problem with Wald’s criteria
3. On reliability of circuits over an arbitrary complete finite basis under single-type constant faults at outputs of elements
4. Counting k-sumsets in groups of prime order
5. On application of generalised polynomials to constructing algorithms to recognise properties of k-valued functions defined by polynomials
6. On universal functions for the set of linear functions
7. Estimation of the distance between partial products of some sequences of linear operators
8. On approximation of maximally nonlinear Boolean functions by almost linear functions
9. Approximation of continuous functions by finite automata
10. Bounds for the number of Boolean functions admitting quadratic approximations of given accuracy
11. Poisson-type limit theorems for the generalised linear inclusion