Extensional Uniformity for Boolean Circuits

Details Extensional Uniformity for Boolean Circuits Extensional Uniformity for Boolean Circuits

2008-05-27

arxiv.org/abs/0805.4072v2

Computer Science

Logic in Computer Science

Scientific paper

Imposing an extensional uniformity condition on a non-uniform circuit complexity class C means simply intersecting C with a uniform class L. By contrast, the usual intensional uniformity conditions require that a resource-bounded machine be able to exhibit the circuits in the circuit family defining C. We say that (C,L) has the "Uniformity Duality Property" if the extensionally uniform class C \cap L can be captured intensionally by means of adding so-called "L-numerical predicates" to the first-order descriptive complexity apparatus describing the connection language of the circuit family defining C. This paper exhibits positive instances and negative instances of the Uniformity Duality Property.

Affiliated with

Also associated with

No associations

Rating

Extensional Uniformity for Boolean Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extensional Uniformity for Boolean Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extensional Uniformity for Boolean Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273257