Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

COCO
1995
Springer

favoriteEmaildiscussreport

113views Algorithms» more COCO 1995»

On the Structure of Low Sets

13 years 8 months ago

On the Structure of Low Sets

Download reference.kfupm.edu.sa

Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexity classes according to their lowness properties. In this paper we highlight some of the more recent advances on selected topics in the area. Among the lowness properties we consider are polynomial-size circuit complexity, membership comparability, approximability, selectivity, and cheatability. Furthermore, we review some of the recent results concerning lowness for counting classes.

Johannes Köbler

Real-time Traffic

Algorithms | COCO 1995 | Lowness Properties | Structural Complexity Theory | Various Complexity Classes |

claim paper

Related Content

» Lightweight set buffer low power data cache for multimedia application

» LowEntropy Set Selection

» A performance study of four index structures for setvalued attributes of low cardinality

» Structured Low Rank Approximation of a Bezout Matrix

» PowerAware Deterministic Block Allocation for LowPower WaySelective Cache Structure

» On the Topical Structure of the Relevance Feedback Set

» On the Structure of Bounded Queries to Arbitrary NP Sets

» Designing Low Cost Networks with Short Routes and Low Congestion

» A Reachability Predicate for Analyzing LowLevel Software

Post Info
More Details (n/a)

Added	25 Aug 2010
Updated	25 Aug 2010
Type	Conference
Year	1995
Where	COCO
Authors	Johannes Köbler

Comments (0)