Search results

Results 1 – 20 of 2,992
Advanced search

Search in namespaces:

There is a page named "Lattice problems" on Wikipedia

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • In computer science, lattice problems are a class of optimization problems related to mathematical objects called lattices. The conjectured intractability...
    28 KB (3,660 words) - 20:46, 21 April 2024
  • Thumbnail for Lattice (group)
    coordinate-wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance...
    17 KB (2,269 words) - 02:43, 22 May 2024
  • on the hardness of well-studied lattice problems, and Cynthia Dwork showed that a certain average-case lattice problem, known as short integer solutions...
    23 KB (2,765 words) - 22:35, 20 February 2024
  • finite lattice representation problem, or finite congruence lattice problem, asks whether every finite lattice is isomorphic to the congruence lattice of...
    4 KB (437 words) - 06:45, 27 February 2024
  • solution (SIS) and ring-SIS problems are two average-case problems that are used in lattice-based cryptography constructions. Lattice-based cryptography began...
    16 KB (3,164 words) - 09:50, 15 May 2024
  • congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed...
    43 KB (5,500 words) - 03:41, 6 January 2024
  • assumptions used in cryptography (including RSA, discrete log, and some lattice problems) can be based on worst-case assumptions via worst-case-to-average-case...
    27 KB (3,227 words) - 22:38, 20 December 2023
  • Thumbnail for Sphere packing
    random packing of equal spheres generally has a density around 63.5%. A lattice arrangement (commonly called a regular arrangement) is one in which the...
    28 KB (3,414 words) - 06:13, 21 May 2024
  • Thumbnail for Dual lattice
    theory of lattices, the dual lattice is a construction analogous to that of a dual vector space. In certain respects, the geometry of the dual lattice of a...
    12 KB (1,857 words) - 05:40, 6 June 2024
  • learning problem. Regev showed that the LWE problem is as hard to solve as several worst-case lattice problems. Subsequently, the LWE problem has been...
    20 KB (3,418 words) - 22:27, 3 May 2024
  • discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts...
    39 KB (6,061 words) - 05:23, 17 June 2024
  • Leech lattice is an even unimodular lattice Λ24 in 24-dimensional Euclidean space, which is one of the best models for the kissing number problem. It was...
    28 KB (4,304 words) - 21:42, 17 May 2024
  • mechanics, the particle in a one-dimensional lattice is a problem that occurs in the model of a periodic crystal lattice. The potential is caused by ions in the...
    18 KB (3,590 words) - 14:48, 24 July 2023
  • consists in mapping a many-body lattice problem to a many-body local problem, called an impurity model. While the lattice problem is in general intractable...
    18 KB (2,710 words) - 00:16, 8 June 2024
  • Thumbnail for Packing problems
    Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to...
    22 KB (2,676 words) - 22:42, 16 April 2024
  • The Millennium Prize Problems are seven well-known complex mathematical problems selected by the Clay Mathematics Institute in 2000. The Clay Institute...
    24 KB (2,654 words) - 03:37, 20 June 2024
  • may still be preferred for solving multiple closest vector problems (CVPs) in the same lattice, where it can be more efficient. The definition of a KZ-reduced...
    5 KB (702 words) - 10:44, 9 September 2023
  • Ajtai and Dwork devised in 1997 a lattice-based public-key cryptosystem; Ajtai has done extensive work on lattice problems. For his numerous contributions...
    7 KB (619 words) - 12:02, 3 December 2023
  • generalization of the previously mentioned problems, as well as graph isomorphism and certain lattice problems. Efficient quantum algorithms are known for...
    39 KB (4,558 words) - 20:57, 1 May 2024
  • Thumbnail for Bravais lattice
    In geometry and crystallography, a Bravais lattice, named after Auguste Bravais (1850), is an infinite array of discrete points generated by a set of...
    21 KB (2,438 words) - 20:04, 9 May 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)