Funder
National Science Foundation
Computing Research Association
College of Liberal Arts, Rochester Institute of Technology
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference29 articles.
1. The complexity of decision versus search;Bellare;SIAM J. Comput.,1994
2. Some comments on functional self-reducibility and the NP hierarchy;Borodin,1976
3. The complexity of theorem-proving procedures;Cook,1971
4. Tradeoffs in the complexity of backdoors to satisfiability: Dynamic sub-solvers and learning during search;Dilkina;Ann. Math. Artif. Intell.,2014
5. Generalized juntas and NP-hard sets;Erdélyi;Theor. Comput. Sci.,2009