Roman Smolensky
- Algebraic methods in the theory of lower bounds for Boolean circuit complexity
1987/01/01 by Roman Smolensky · 8 citations
Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Coding theory and cryptography #Quantum Computing Algorithms and Architecture #Oracle #Boolean function #Mathematics #Boolean circuit #Algebraic number #Circuit complexity #Constant (computer programming) #Statement (logic) #Electronic circuit #Discrete mathematics #Set (abstract data type) #Parity function #Prime (order theory) #Combinatorics #Arithmetic #Computer science #Boolean expression