Diana Emme  Home/Search
Context
Related
| info4.informatik.uniwue...emme92.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.uniwuerzburg.d...tr_e (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the first part of this article we introduce function definability. Let F be a class of functions. We show that every F-definable class of languages already contains UF " co-UF , and if F is closed under subtraction from one then the kernel itself is F-definable. In the next part we investigate lowness of function classes, where we specialize on classes basing on the class P with arbitrary oracles which are transformed into function classes by the operators #, Gap, span, and F. We prove for... (Update)
Active bibliography (related documents): More All
0.5: Gap-Definable Counting Classes - Fenner, Fortnow, Kurtz (1992) (Correct)
0.3: Links Between Complexity Theory and Constrained Block Coding - Stockmeyer, Modha (Correct)
0.2: A Complexity Theory for Feasible Closure Properties - Ogiwara, Hemachandra (1991) (Correct)
Similar documents based on text: More All
0.5: A Note on SpanP Functions - Meena Mahajan Thomas (Correct)
0.2: On Cluster Machines and Function Classes - Kosub (1997) (Correct)
0.1: Graph Isomorphism is Low for ZPP(NP) and other Lowness results - Arvind, Köbler (1999) (Correct)
BibTeX entry: (Update)
@misc{ emme-kernel,
author = "Diana Emme",
title = "A Kernel for Function Definable Classes and Its Relation to Lowness",
url = "citeseer.ist.psu.edu/220058.html" }
Citations (may not include all citations):251 The complexity of computing the permanent (context) - Valiant - 1979
151 The complexity of optimization problems (context) - Krentel - 1988
90 The complexity of combinatorial problems with succinct input.. (context) - Wagner - 1986
86 Gap-definable counting classes - Fenner, Fortnow et al. - 1991
38 PP is closed under truth-table reductions - Fortnow, Reingold - 1991
31 A complexity theory for feasible closure properties - Ogiwara, Hemachandra - 1991
16 Complexity of functions versus complexity of sets (context) - Vollmer, Wagner - 1991
16 Classes of counting functions and complexity theoretic opera.. - Vollmer, Wagner - 1991
14 A low and a high hierarchy within NP (context) - Schoning - 1983
13 Structural Properties of the Counting Hierarchies (context) - Tor'an - 1988
12 and Joaquim Gabarr'o (context) - Balc'azar, D'iaz - 1988
8 Structural Complexity II (context) - Balc'azar, D'iaz et al. - 1990
7 The power of witness reduction (context) - Gupta - 1991
3 Strukturelle Komplexitat von Anzahlproblemen (context) - Kobler - 1989
Documents on the same site (http://www.informatik.uni-wuerzburg.de/reports/tr_e.html): More
Moment Approximation in Product Form Queueing Networks - Mittler, Müller (1995) (Correct)
Spanning Tree Based State Encoding for Low Power Dissipation - Nöth, Kolla (1999) (Correct)
Analysis of a Rate-Based Control Policy with Delayed Feedback and .. - Ritter (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC