Cody D. Murray
- Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP
2018/06/20 by Cody D. Murray, Ryan Williams · 1 citation
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Machine Learning and Algorithms #Cryptography and Data Security #Nondeterministic algorithm #Lemma (botany) #Discrete mathematics #Mathematics #Combinatorics #Satisfiability #Time complexity #Electronic circuit #Algorithm #Computer science