Lukas' Notes

Pseudo-Polynomial Time Algorithm

1 min read

Definition

Pseudo-Polynomial Time Algorithm

Define your knowledge here…

Backlinks

Exact Optimisation via Integrality (FPTAS)
Strong NP-Hard Decision Problem
Strong NP-Hardness Rules Out FPTAS
Weak NP-Hard Decision Problem

Created with Quartz v4.5.2 © 2026

GitHub