Minimum Tree-width of circuit for MAJORITY
Posted by SamiD, at cstheory.stackexchange.com,
What is the minimum tree-width of a circuit over $\{\wedge,\vee,\neg\}$ for computing MAJ? Here MAJ $:\{0,1\}^n \rightarrow \{0…
Computer Science -- Theory and Applications
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Algorithms for Energy Management
-
Altmetric BadgeChapter 2 Sofic and Almost of Finite Type Tree-Shifts
-
Altmetric BadgeChapter 3 Proof-Based Design of Security Protocols
-
Altmetric BadgeChapter 4 Approximating the Minimum Length of Synchronizing Words Is Hard
-
Altmetric BadgeChapter 5 Realizability of Dynamic MSC Languages
-
Altmetric BadgeChapter 6 The max quasi-independent set Problem
-
Altmetric BadgeChapter 7 Equilibria in Quantitative Reachability Games
-
Altmetric BadgeChapter 8 Quotient complexity of closed languages
-
Altmetric BadgeChapter 9 Right-Sequential Functions on Infinite Words
-
Altmetric BadgeChapter 10 Kernelization
-
Altmetric BadgeChapter 11 Zigzags in Turing Machines
-
Altmetric BadgeChapter 12 Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
-
Altmetric BadgeChapter 13 Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
-
Altmetric BadgeChapter 14 Identical Relations in Symmetric Groups and Separating Words with Reversible Automata
-
Altmetric BadgeChapter 15 Time Optimal d-List Colouring of a Graph
-
Altmetric BadgeChapter 16 The Cantor Space as a Generic Model of Topologically Presented Knowledge
-
Altmetric BadgeChapter 17 Algorithmics – Is There Hope for a Unified Theory?
-
Altmetric BadgeChapter 18 Classifying Rankwidth k-DH-Graphs
-
Altmetric BadgeChapter 19 Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms
-
Altmetric BadgeChapter 20 A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem
-
Altmetric BadgeChapter 21 Balancing Bounded Treewidth Circuits
-
Altmetric BadgeChapter 22 Obtaining Online Ecological Colourings by Generalizing First-Fit
-
Altmetric BadgeChapter 23 Classical Simulation and Complexity of Quantum Computations
-
Altmetric BadgeChapter 24 Prefix-Free and Prefix-Correct Complexities with Compound Conditions
-
Altmetric BadgeChapter 25 Monotone Complexity of a Pair
-
Altmetric BadgeChapter 26 Symbolic Models for Single-Conclusion Proof Logics
-
Altmetric BadgeChapter 27 Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA
-
Altmetric BadgeChapter 28 Advancing Matrix Computations with Randomized Preprocessing
-
Altmetric BadgeChapter 29 Transfinite Sequences of Constructive Predicate Logics
-
Altmetric BadgeChapter 30 The Quantitative Analysis of User Behavior Online — Data, Models and Algorithms
-
Altmetric BadgeChapter 31 A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
-
Altmetric BadgeChapter 32 Complexity of Propositional Proofs
-
Altmetric BadgeChapter 33 Quantization of Random Walks: Search Algorithms and Hitting Time
-
Altmetric BadgeChapter 34 Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems
-
Altmetric BadgeChapter 35 Growth of Power-Free Languages over Large Alphabets
-
Altmetric BadgeChapter 36 A Partially Synchronizing Coloring
-
Altmetric BadgeChapter 37 An Encoding Invariant Version of Polynomial Time Computable Distributions
-
Altmetric BadgeChapter 38 Prehistoric Phenomena and Self-referentiality
Altmetric Badge
About this Attention Score
-
In the top 25% of all research outputs scored by Altmetric
-
Good Attention Score compared to outputs of the same age (78th percentile)
-
Good Attention Score compared to outputs of the same age and source (76th percentile)
Citations
- dimensions_citation
- 1 Dimensions
Readers on
- mendeley
- 1 Mendeley