Graph View
All Domains
All Tags
#reductions
11 topics
Computer Science
Polynomial Many-One Reductions
Graduate
Formal Sciences And Logic
3-SAT and Reduction-Based Hardness Proofs
Graduate
Computability Reductions
College
Hardness of Approximation Introduction
Graduate
Many-One Reducibility in Computability
College
Many-One Reductions and Undecidability Proofs
College
Many-One and Turing Reducibility
Graduate
NL-Completeness and Space-Bounded Reductions
Graduate
NP-Hardness: Definition and Properties
Graduate
Polynomial-Time Reductions
College
Reductions for Proving NP-Completeness
College