2
votes
Accepted
Complexity of a Set of Formulas
Yes. You can build a Boolean circuit $\beta_n$ of size $O(n \lg n)$, that is equivalent to $\alpha_n$. It works by counting the number of "true"s among the inputs, compares it to $n$, and ...

D.W.♦
- 154k
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
propositional-logic × 198logic × 117
satisfiability × 32
first-order-logic × 30
complexity-theory × 21
boolean-algebra × 15
algorithms × 12
proof-techniques × 8
artificial-intelligence × 7
discrete-mathematics × 7
logical-validity × 5
terminology × 4
decision-problem × 4
sat-solvers × 4
hoare-logic × 4
natural-deduction × 4
graphs × 3
optimization × 3
np-complete × 3
reductions × 3
space-complexity × 3
sets × 3
finite-automata × 2
context-free × 2
machine-learning × 2