Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

computational hardness assumption · Vinony

EntityQ5157320· pop 5· linked from 59 articles

computational hardness assumption

Sign in to save

hypothesis in computational complexity theory

Connections

time complexity

International Standard Book Number

mathematical proof

digital object identifier

composite number

public-key cryptography

quantum computing

Euler's totient function

Categories

Computational hardness assumptions Computational number theory Theory of cryptography

Sources

wikipedia.externallinksexternallink

What links here59 pages

pseudorandom number generator

learning with errors

discrete logarithm

Diffie–Hellman problem

time complexity

provable security

Ciphertext indistinguishability

exponential time hypothesis

lattice-based cryptography

elliptic curve cryptography

John Forbes Nash

feedback vertex set

information-theoretic security

ElGamal signature scheme

Feedback arc set

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.34

strong NP-completeness

Entitydist 0.37

computational complexity theory

Entitydist 0.37

Entitydist 0.38

Category:Theorems in computational complexity theory

Entitydist 0.39

Entitydist 0.44

Entitydist 0.45

Entitydist 0.45

computational complexity

Entitydist 0.45

Entitydist 0.46

computability theory

Entitydist 0.48

Category:Computational complexity theory

Entitydist 0.48