# complexity theory – Since P-Uniform = P does NP-Uniform (is there such a thing?) = NP?

A circuit family is $$P−Uniform$$ if there exists a polynomial time $$DTM$$ which on an input of $$1^n$$ outputs the description of $$Cn$$, the $$n$$th circuit.

Presumably $$NP-Uniform$$ would look something like it: a circuit family is $$NP-Uniform$$ if there exists a polynomial time $$NDTM$$ which on an input of $$1^n$$ outputs the description of $$Cn$$, the $$n$$th circuit.

$$P-Uniform = P$$ does $$NP-Uniform = NP$$?