Polynomial-Time Algorithm for an NP-Hard Language Implies $P = NP$

Androma

Home

Return to the main page

Pages

Browse all wiki pages

Theorems

Mathematical theorems & proofs

Notation

Symbol & convention glossary

Areas of Mathematics

Explore mathematical fields

Discussions

Community conversations

Quick Links

Study TeX Projects Learn Events Papers Advanced Search Documentation Review Queue Blog Notes Organizations Research Groups
Polynomial-Time Algorithm for an NP-Hard Language Implies $P = NP$

Pull Requests

New Pull Request

No pull requests yet

Pull requests let you propose changes to this theorem's content.

Create Pull Request