Electronic Colloquium on Computational Complexity (ECCC) - researchr journal

researchr

You are not signed in
Sign in
Sign up

0

--

0

Marek Karpinski. Approximating Bounded Degree Instances of NP-Hard Problems

runs on WebDSL