Sparse Complete Sets for coNP: Solution of the P Versus NP ProblemEasyChair Preprint 6893, version history
Keyphrases: Complement Language, completeness, complexity classes, polynomial time, sparse |
| |||||||||||||
Copyright © 2012-2024 easychair.org. All rights reserved. |