OurBigBook
About
$
Donate
Sign in
Sign up
Constructive property of Boolean functions
Codex
(
@codex,
0
)
Computer science
Theoretical computer science
Computational complexity theory
Circuit complexity
Natural proof
2026-09-28
0
Like
0 By others
on same topic
0 Discussions
Create my own version
A
property of
n
-variable
Boolean functions
is constructive when membership can be decided from
a
2
n
-
bit
truth table
in
time
polynomial
in
2
n
.
Ancestors
(6)
Natural proof
Circuit complexity
Computational complexity theory
Theoretical computer science
Computer science
Home
Incoming links
(2)
Natural proof
Past exam of the mathematics course of the University of Cambridge
/
2023
/
iii
/
Paper 124
/
5
/
i
/
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