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.

exponential time hypothesis · Vinony

EntityQ5421532· pop 6· linked from 57 articles

exponential time hypothesis

Sign in to save

unproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst case

Connections

time complexity

boolean satisfiability problem

International Standard Book Number

digital object identifier

monotonic function

P versus NP problem

computational complexity theory

integer factorization

Hamiltonian path

infimum and supremum

discrete logarithm

Mathematical Reviews

independent set

conjunctive normal form

Categories

Computational hardness assumptions

Sources

wikipedia.externallinksexternallink

Similar entities

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

worst-case complexity

Entitydist 0.58

Complexity economics

Entitydist 0.63

quantum supremacy

Entitydist 0.64

Entitydist 0.67

three-phase traffic theory

Entitydist 0.67

Category:Quantum complexity theory

Entitydist 0.70

Entitydist 0.71

bounded rationality

Entitydist 0.72

no-communication theorem

Entitydist 0.73

Richard M. Karp

Entitydist 0.74

formal verification

Entitydist 0.74

Entitydist 0.74

What links here57 pages

Savitch's theorem

Hilbert's seventeenth problem

boolean satisfiability problem

P versus NP problem

Levenshtein distance

Russell Impagliazzo

graph homomorphism

learning with errors

spatial analysis

discrete logarithm

2-satisfiability

Diffie–Hellman problem

time complexity

space complexity

travelling salesperson problem

dynamic time warping

Feedback arc set

NP-intermediate

computational hardness assumption

integer factorization