PDFCOKE
Home
(current)
Explore
Explore All
Upload
Login / Register
Home
Testing Membership In The {0, 1/2}-closure Is Strongly Np-hard, Even For Polytopes Contained In The N-dimensional 0/1-cube (2009)
Report
Report Testing Membership In The {0, 1/2}-closure Is Strongly Np-hard, Even For Polytopes Contained In The N-dimensional 0/1-cube (2009)
Please enter report details, we'll process the request within 1-3 business days.
-Select Reason-
Pornographic
Defamatory
Illegal/Unlawful
Spam
Other Terms Of Service Violation
File a copyright complaint
Submit Report