A Generalized Quantifier Concept in Computational Complexity Theory

Details A Generalized Quantifier Concept in Computational Complexity Theory A Generalized Quantifier Concept in Computational Complexity Theory

1998-09-28

arxiv.org/abs/cs/9809115v1

Computer Science

Computational Complexity

Scientific paper

A notion of generalized quantifier in computational complexity theory is
explored and used to give a unified treatment of leaf language definability,
oracle separations, type 2 operators, and circuits with monoidal gates.
Relations to Lindstroem quantifiers are pointed out.

Affiliated with

Also associated with

No associations

Rating

A Generalized Quantifier Concept in Computational Complexity Theory 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 A Generalized Quantifier Concept in Computational Complexity Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalized Quantifier Concept in Computational Complexity Theory will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-481994