Repository Issues

jfinkels/apxcompleteness

Proof that Maximum 3-Satisfiability is complete for APX under polynomial time AP reductions.

View on GitHub
Stars
 (1 star)
Forks
 (0 forks)
Indexed issues
 (0 indexed issues)
open beginner issues
 (0 open beginner issues)
Latest indexed
Not indexed yet
Last GitHub push
Sep 16, 2015
License
No license data
Contributing guide
No contributing guide
Code of conduct
No code of conduct
Dominant language
TeX
PR merge metrics
 (PR metrics pending)
Beginner labels
No beginner labels indexed

Issues

0 open indexed issues

RSSAtom

No open indexed issues found for this repository.