- On the complexity of branching programs and decision trees for clique functions
1988/04/01 by Ingo Wegener · 1 citation
Computer Science · Mathematics · #Advanced Algebra and Logic #Rough Sets and Fuzzy Logic #Commutative Algebra and Its Applications #Branching (polymer chemistry) #Boolean function #Mathematics #Combinatorics #Clique #Exponential function #Discrete mathematics #Binary decision diagram #Hierarchy #Time complexity #Circuit complexity #Algorithm
- The monotone circuit complexity of boolean functions
1987/03/01 by Noga Alon, Ravi B. Boppana · 7 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Boolean circuit #Boolean function #Circuit complexity #Clique #Combinatorics #Complexity and Algorithms in Graphs #Discrete mathematics #Electronic circuit #Exponential function #Function (biology) #Graph #Machine Learning and Algorithms #Mathematical analysis #Mathematics #Monotone polygon #Upper and lower bounds