Advanced
Theory of Computation
Q89 / 100
What is the connection between Boolean circuits and uniform complexity classes?
Correct! Well done.
Incorrect.
The correct answer is B) P/poly is the class of languages decidable by polynomial-size (non-uniform) circuits; P corresponds to uniform circuit families generated in logspace
B
Correct Answer
P/poly is the class of languages decidable by polynomial-size (non-uniform) circuits; P corresponds to uniform circuit families generated in logspace
Explanation
A language is in P/poly iff it has polynomial-size circuit families (non-uniform). Uniformity (logspace-uniform) restricts to P. NC ⊆ P corresponds to shallow, parallel circuits.
Progress
89/100