Back to Results
First PageMeta Content



AND-compression of NP-complete problems: Streamlined proof and minor observations Holger Dell Saarland University Cluster of Excellence, MMCI ∗ September 23, 2014
Add to Reading List

Open Document

File Size: 467,14 KB

Share Result on Facebook

Company

Dell / /

Facility

University Cluster / /

IndustryTerm

d-partite composition algorithm / coNP-algorithm / polynomial-time algorithm / composition algorithm / deterministic kernelization algorithms / kernelization algorithm / randomized kernelization algorithms / kernelization algorithms / randomized polynomial-time algorithm / compression algorithms / statistical zero-knowledge proof systems / deterministic polynomial-time algorithm / zero-knowledge proof systems / be solved using statistical zero-knowledge proof systems / /

Person

Santhanam / Holger Dell / /

Position

player / /

ProgrammingLanguage

L / /

Technology

deterministic kernelization algorithms / randomized algorithm / randomized kernelization algorithms / d-partite composition algorithm / randomized compression algorithms / deterministic polynomial-time algorithm / composition algorithm / kernelization algorithms / kernelization algorithm / randomized P/poly-algorithm / polynomial-time algorithm / randomized polynomial-time algorithm / /

SocialTag