Complexity Classes and Theories for the Comparator Circuit Value Problem

Details Complexity Classes and Theories for the Comparator Circuit Value Problem Complexity Classes and Theories for the Comparator Circuit Value Problem

2011-06-21

arxiv.org/abs/1106.4142v2

Computer Science

Computational Complexity

This version was substantially rewritten, where several proofs were rewritten and many typos and mistakes were fixed. A shorte

Scientific paper

Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem. He proved that several other problems are complete for CC, including the stable marriage problem, and finding the lexicographical first maximal matching in a bipartite graph. We suggest alternative definitions of CC based on different reducibilities and introduce a two-sorted theory VCC* based on one of them. We sharpen and simplify Subramanian's completeness proofs for the above two problems and formalize them in VCC*.

Affiliated with

Also associated with

No associations

Rating

Complexity Classes and Theories for the Comparator Circuit Value Problem 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 Complexity Classes and Theories for the Comparator Circuit Value Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity Classes and Theories for the Comparator Circuit Value Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-178199