Popular Searches
Definitions
nonuniform
P-nonuniform
A family of Boolean circuits is P-uniform if a Turing machine given 1n can output the member of the family with n inputs in time polynomial in n. A problem is P-nonuniform if no family of minimal Boolean circuits for the problem is P-uniform.
External links
Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Wednesday December 26, 2007 at 23:45:58 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
This article is licensed under the GNU Free Documentation License.
Last updated on Wednesday December 26, 2007 at 23:45:58 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation
Related Articles
|
|
|
|
|
|
|
|
|
|
|
HighBeam Research, Inc. © Copyright 2009.
Copyright © 2013 Dictionary.com, LLC. All rights reserved.
