Sven Kosub  Home/Search
Context Related
| www14.in.tum.de/personen/...kosub00.ps 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: www14.in.tum.de/pe...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The boolean hierarchy of k-partitions over NP for k >= 3 was introduced as a generalization of the well-known boolean hierarchy of sets (2-partitions). The classes of this hierarchy are exactly those classes of NP-partitions which are generated by finite labeled lattices. We generalize the boolean hierarchy of NP-partitions by studying partition classes which are defined by finite labeled posets. We give an exhaustive answer to the question of which relativizable inclusions between partition... (Update)
Similar documents based on text: More All
0.6: The Boolean Hierarchy of NP-Partitions - Kosub, Wagner (2000) (Correct)
0.5: Boolean NP-Partitions and Projective Closure - Kosub (2003) (Correct)
0.4: On NP-Partitions over Posets with an Application to Reducing the.. - Kosub (2000) (Correct)
BibTeX entry: (Update)
S. Kosub. On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems April 2000. http://citeseer.ist.psu.edu/kosub00nppartitions.html More
@inproceedings{ kosub00nppartitions,
author = "Sven Kosub",
title = "On {NP}-Partitions over Posets with an Application to Reducing the Set
of Solutions of {NP} Problems",
booktitle = "Mathematical Foundations of Computer Science",
pages = "467--476",
year = "2000",
url = "citeseer.ist.psu.edu/kosub00nppartitions.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPCom.. (context) - Garey, Johnson - 1979
951 Computational Complexity (context) - Papadimitriou - 1994
105 Bounded query classes (context) - Wagner - 1990
94 Complexity measures for public-key cryptosystems (context) - Grollmann, Selman - 1988
61 A taxonomy of complexity classes of functions - Selman - 1994
60 Generic oracles and oracle classes (context) - Blum, Impagliazzo - 1987
45 Quantitative relativizations of complexity classes (context) - Book, Long et al. - 1984
38 Computing solutions uniquely collapses the polynomial hierar.. - Hemaspaandra, Naik et al. - 1996
34 Relativizable and non-relativizable theorems in the polynomi.. - Vereshchagin - 1993
30 the power of number-theoretic operations with respect to cou.. - Hertrampf, Vollmer et al. - 1995
23 The Boolean hierarchy: Hardware over NP (context) - Cai, Hemachandra - 1986
23 General Lattice Theory (context) - Gr - 1978
20 Inverting onto functions - Fenner, Fortnow et al. - 1996
20 On using oracles that compute values - Fenner, Homer et al. - 1997
18 A survey of one-way functions in complexity theory (context) - Selman - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://www14.in.tum.de/personen/kosub/publication/publications.html): More
Generic Separations and Leaf Languages - Galota, Kosub, Vollmer (2001) (Correct)
Uniform Characterizations of Complexity Classes of Functions - Kosub, Schmitz, Vollmer (2000) (Correct)
Boolean Partitions and Projective Closure - Kosub (2000) (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