Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. Fault-tolerant resolvability of some graphs of convex polytopes: Label: en
  2. On the equality problem of finitely generated classes of exponentially-polynomial functions: Label: en
  3. On a number of particles in a marked set of cells in a general allocation scheme: Label: en
  4. On scatter properties of modular addition operation over imprimitivity systems of the translation group of the binary vector space: Label: en
  5. On bases of all closed classes of Boolean vector functions: Label: en
  6. On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\): Label: en
  7. Limit theorem for stationary distribution of a critical controlled branching process with immigration: Label: en
  8. Limit theorem for a smoothed version of the spectral test for testing the equiprobability of a binary sequence: Label: en
  9. Classes of piecewise-quasiaffine transformations on the generalized \(2\)-group of quaternions: Label: en
  10. On polynomial-modular recursive sequences: Label: en
  11. On algebraicity of lattices of \(\omega \)-fibred formations of finite groups: Label: en
  12. On the universality of product for classes of linear functions of two variables: Label: en
  13. On properties of multiaffine predicates on a finite set: Label: en
  14. The limit joint distributions of statistics of three tests of the NIST package: Label: en
  15. Nonlinearity of functions over finite fields: Label: en
  16. Short complete diagnostic tests for circuits with two additional inputs in some basis: Label: en
  17. Limit theorems for the maximal tree size of a Galton-Watson forest in the critical case: Label: en
  18. On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph: Label: en
  19. Criteria for maximal nonlinearity of a function over a finite field: Label: en
  20. Explicit basis for admissible rules in \(K\)-saturated tabular logics: Label: en
  21. Mutually orthogonal Latin squares as group transversals: Label: en
  22. Decomposition of polynomials using the shift-composition operation: Label: en
  23. Asymptotic local probabilities of large deviations for branching process in random environment with geometric distribution of descendants: Label: en
  24. On the existence of special nonlinear invariants for round functions of XSL-ciphers: Label: en
  25. On the number of boundary classes in the 3-colouring problem: Label: en
  26. Rings over which all finitely generated modules are ℵ0-injective: Label: en
  27. Description of finite nonnilpotent rings with planar zero-divisor graphs: Label: en
  28. On some equations related to the tpp-groups: Label: en
  29. A parametric model of embedding and its statistical analysis: Label: en
  30. On the choice of the defence strategy for an authentication code with two-state source: Label: en
  31. On quantum realisation of Boolean functions by the fingerprinting technique: Label: en
  32. Nondegenerate colourings in the Brooks theorem: Label: en
  33. Defragmentation of permutation tables with four columns: Label: en
  34. Problems on independence systems solvable by the greedy algorithm: Label: en
  35. Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series: Label: en
  36. On the game-theoretical approach to the analysis of authentication codes: Label: en
  37. The key space of the McEliece–Sidelnikov cryptosystem: Label: en
  38. On finite lattices of topologies of commutative unary algebras: Label: en
  39. The factorisation of one-generated partially foliated formations: Label: en
  40. Optimal paths in oriented graphs and eigenvectors in max-⊗ systems: Label: en
  41. On combinatorial Gray codes with distance 3: Label: en
  42. Positively closed classes of three-valued logic generated by one-place functions: Label: en
  43. On a constructive approach to the calculation of cardinality of the Ryser classes: Label: en
  44. On the estimation of the periods of noisy binary periodic sequences: Label: en
  45. On the limit distributions of the vertex degrees of conditional Internet graphs: Label: en
  46. On five types of stability of the lexicographic variant of the combinatorial bottleneck problem: Label: en
  47. On one statistical model of steganography: Label: en
  48. On a class of statistics of polynomial samples: Label: en
  49. Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials: Label: en
  50. Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)