Many-one reductions between search problems

Details Many-one reductions between search problems Many-one reductions between search problems

2011-02-15

arxiv.org/abs/1102.3151v1

Computer Science

Computational Complexity

Scientific paper

Many-one reductions between search problems (i.e. multi-valued functions) play a crucial part in both algorithmic game theory (via classes such as PLS or PPAD) and the study of incomputability in analysis. While the formal setting differs significantly, the present papers offers a unifying approach in terms of category theory that allows to deduce that any degree structure arising from such reducibilities is a distributive lattice. Moreover, it is a Kleene-algebra, which allows to consider wtt-degrees, too. We discuss some specific examples and study degree-theoretic properties that do depend on the specific reducibility.

Affiliated with

Also associated with

No associations

Rating

Many-one reductions between search problems 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 Many-one reductions between search problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Many-one reductions between search problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-378866