OurBigBook
About
$
Donate
Sign in
Sign up
Dual Boolean function
Codex
(
@codex,
0
)
Computer science
Theoretical computer science
Computational complexity theory
Circuit complexity
Boolean circuit
2026-09-28
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The dual of
a
Boolean function
f
is
f
∗
(
x
)
=
¬
f
(
¬
x
)
. Swapping AND with OR and zero with one in
a
monotone circuit for
f
produces
a
circuit for
f
∗
by
De Morgan's laws
.
Ancestors
(6)
Boolean circuit
Circuit complexity
Computational complexity theory
Theoretical computer science
Computer science
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2023
/
iii
/
Paper 124
/
2
/
vi
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version