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. A generalized dialogue graph construction and visualization based on a corpus of dialogues: Label: en
  2. A validation algorithm of the transmitter`s boundedly deterministic behaviour in a partial erasure channel: Label: en
  3. Attractors and cyclic states in finite dynamic systems of complete graphs orientations: Label: en
  4. An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs: Label: en
  5. Ternary forking lemma and its application to the analysis of one code-based signature: Label: en
  6. Zero-knowledge succinct non-interactive arguments of knowledge based on sets of polynomials: Label: en
  7. On equations in free monoids and semigroups with restrictions on solutions: Label: en
  8. Application of idempotent algebra methods in genetic algorithm for solving the scheduling problem: Label: en
  9. The generic complexity of the graph triangulation problem: Label: en
  10. Effective algorithm for finding shortest paths in dense Gaussian networks: Label: en
  11. About uniqueness of the minimal 1-edge extension of hypercube Q4: Label: en
  12. A direct method for calculating cell cycles of a block map of a simple planar graph: Label: en
  13. The method for constructing uniform planar approximations of the filter generator: Label: en
  14. Search for differences for Alzette S-Box with maximum or close to maximum differential characteristic probability: Label: en
  15. Direct powers of algebraic structures and equations: Label: en
  16. On ideal class group computation of imaginary multiquadratic fields: Label: en
  17. About the rate of normal approximation for the distribution of the number of repetitions in a stationary discrete random sequence: Label: en
  18. Analysis of minimal distance of AG-code associated with maximal curve of genus three: Label: en
  19. Median for an odd number of linear order relations and its use in group choice problems: Label: en
  20. The generic complexity of the bounded problem of graphs clustering: Label: en
  21. The security of the code-based signature scheme based on the Stern identification protocol: Label: en
  22. Flaws of hypercube-like ciphers: Label: en
  23. A randomized analog of Chaum - van Antwerpen undeniable signature: Label: en
  24. On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes: Label: en
  25. Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction: Label: en
  26. THE GENERAL COMPLEXITY OF THE PROBLEM TO RECOGNIZE HAMILTONIAN PATHS: Label: en
  27. THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS: Label: en
  28. ALGORITHMS FOR SOLVING SYSTEMS OF EQUATIONS OVER VARIOUS CLASSES OF FINITE GRAPHS: Label: en
  29. CHARACTERISTICS OF HADAMARD SQUARE OF SPECIAL REED — MULLER SUBCODES: Label: en
  30. THE ATTACKERS POWER BOUNDARIES FOR TRACEABILITY OF ALGEBRAIC GEOMETRIC CODES ON SPECIAL CURVES: Label: en
  31. DETECTING SERVER-SIDE ENDPOINTS IN WEB APPLICATIONS BASED ON STATIC ANALYSIS OF CLIENT-SIDE JavaScript CODE: Label: en
  32. SPECTRAL PROBABILISTIC AND STATISTICAL ANALYSIS OF MARKOV CIPHERS: Label: en
  33. EQUATIONS OVER DIRECT POWERS OF ALGEBRAIC STRUCTURES IN RELATIONAL LANGUAGES: Label: en
  34. MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE: Label: en
  35. COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA: Label: en
  36. ALGORITHMS FOR COMPUTING CRYPTOGRAPHIC CHARACTERISTICS OF VECTORIAL BOOLEAN FUNCTIONS: Label: en
  37. ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM: Label: en
  38. ASSOCIATIVE PARALLEL ALGORITHM FOR DYNAMIC UPDATE OF SHORTEST PATHS TREE AFTER INSERTING AN ARC: Label: en
  39. A METHOD FOR CONSTRUCTING LOGIC NETWORKS ALLOWING SHORT SINGLE DIAGNOSTIC TESTS: Label: en
  40. CRYPTANALYTICAL FINITE AUTOMATON INVERTIBILITY WITH FINITE DELAY: Label: en
  41. 2-TRANSITIVITY DEGREE FOR ONE CLASS OF SUBSTITUTIONS OVER FINITE FIELDS: Label: en
  42. SOME METHODS FOR CONSTRUCTING MDS-MATRICES OVER FINITE FIELD: Label: en
  43. NON-CONTRADICTORY AGGREGATION OF QUASI-ORDER RELATIONS: Label: en
  44. THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION: Label: en
  45. MINIMIZATION OF CONTEXT-FREE GRAMMARS: Label: en
  46. ON COMPLEXITY OF THE EXISTENTIAL AND UNIVERSAL THEORIES OF FINITE FIELDS: Label: en
  47. ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS: Label: en
  48. APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM: Label: en
  49. COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH: Label: en
  50. SUFFICIENT CONDITIONS FOR IMPLEMENTATION OF BOOLEAN FUNCTIONS BY ASYMPTOTICALLY OPTIMAL ON RELIABILITY CIRCUITS WITH THE TRIVIAL ESTIMATE OF UNRELIABILITY IN THE CASE OF FAULTS OF TYPE 0 AT THE ELEMENT OUTPUTS: Label: en

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

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:EntityUsage/Q4986233"
Powered by MediaWiki