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.

complete · Vinony

EntityQ2532728· pop 7· linked from 52 articles

complete

Sign in to save

notion of the "hardest" or "most general" problem in a complexity class

Connections

International Standard Book Number

digital object identifier

computational complexity theory

complexity class

computational problem

recursively enumerable set

Categories

Computational complexity theory

Sources

wikipedia.externallinksexternallink

What links here52 pages

polynomial hierarchy

proof of impossibility

true quantified Boolean formula

Oblivious transfer

Steinitz's theorem

complexity class

Jean Charles Athanase Peltier

handshaking lemma

decision problem

kobon triangle problem

computational complexity theory

Log-space reduction

intersection graph

graph isomorphism problem

computational hardness assumption

Similar entities

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

Entitydist 0.32

computational complexity theory

Entitydist 0.32

Entitydist 0.38

Entitydist 0.39

Entitydist 0.40

Entitydist 0.43

Entitydist 0.43

No Silver Bullet

Entitydist 0.44

computational hardness assumption

Entitydist 0.45

PSPACE-complete

Entitydist 0.45

Entitydist 0.46

strong NP-completeness

Entitydist 0.48