Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Search

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

pseudo-polynomial time · Vinony

🌐English

English Bahasa Indonesia Deutsch Español Français Italiano Polski Português Русский 中文

EntityQ155291· pop 12· linked from 39 articles

pseudo-polynomial time

Term in Complexity Theory

Connections

time complexity

Categories

Analysis of algorithms Complexity classes Computational complexity theory Pseudo-polynomial time algorithms

Sources

wikipedia.externallinksexternallink

strong NP-completeness

Entity

P versus NP problem

dynamic programming

computational complexity theory

unary numeral system

knapsack problem

analysis of algorithms

AKS primality test

David S. Johnson

partition problem

Sign in to save

What links here39 pages

knapsack problem

Alexandrov's uniqueness theorem

subset sum problem

sieve of Eratosthenes

bin packing problem

Shapley–Shubik power index

strong NP-completeness

maximum flow problem

partition problem

Shor's algorithm

change-making problem

Congestion game

Similar entities

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

polynomial time

Entitydist 0.35

Quasi-polynomial

Entitydist 0.40

Sparse language

Entitydist 0.41

Entitydist 0.44

Kolmogorov complexity

Entitydist 0.49

Entitydist 0.50

Entitydist 0.51

Computational complexity of mathematical operations

Entitydist 0.51

Arthur–Merlin protocol

Entitydist 0.53

finite-state machine

Entitydist 0.61

nondeterministic finite automaton

Entitydist 0.62

Cantor–Zassenhaus algorithm

Entitydist 0.62