Electronic Colloquium on Computational Complexity (ECCC) - researchr journal

researchr

You are not signed in
Sign in
Sign up

0

--

0

Piotr Berman, Marek Karpinski. Approximating Minimum Unsatisfiability of Linear Equations

runs on WebDSL