Bernd Borchert, Riccardo Silvestri  Home/Search
Context
Related
| math.uniheidelberg....dotoperators.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: math.uniheidelberg.de...bbpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Well-known examples of dot operators are the existential, the counting, and the BP-operator. We will generalize this notion of a dot operator so that every language A will determine an operator A \Delta . In fact we will introduce the more general notion of promise dot operators for which the BPoperator is an example. Dot operators are a refinement of the leaf language concept because the class determined by a leaf language A equals A \Delta P. Moreover we are able to represent not only... (Update)
Similar documents (at the sentence level):
61.2%: Dot Operators - Borchert, Silvestri (Correct)
Active bibliography (related documents): More All
0.4: Query Order and Self-Specifying Machines - Hemaspaandra, Hempel, Wechsung (1995) (Correct)
0.3: Generalized Quantifiers in Computational Complexity Theory - Vollmer (1998) (Correct)
0.3: Randomization and Derandomization in Space-Bounded Computation - Saks (1996) (Correct)
Similar documents based on text: More All
0.6: The Characterization of the Leaf Language Classes - Borchert, Silvestri (1994) (Correct)
0.3: Observations on Measure and Lowness for . . . - Lutz (1996) (Correct)
0.2: On Existentially First-Order Definable Languages and their.. - Borchert, Kuske (1998) (Correct)
BibTeX entry: (Update)
@article{ borchert01dot,
author = "Bernd Borchert and Riccardo Silvestri",
title = "Dot operators",
journal = "Theoretical Computer Science",
volume = "262",
number = "1--2",
pages = "501--523",
year = "2001",
url = "citeseer.ist.psu.edu/511330.html" }
Citations (may not include all citations):951 Computational Complexity (context) - Papadimitriou - 1994
211 Languages that capture complexity classes - Immerman - 1987
129 Theoretical Computer Science (context) - Stockmeyer, hierarchy - 1977
122 A comparison of polynomial time reducibilities (context) - Ladner, Lynch et al. - 1975
90 The complexity of combinatorial problems with succinct input.. (context) - Wagner - 1986
66 Structural Complexity (context) - Balcazar, Diaz et al. - 1988
58 Games against nature (context) - Papadimitriou
53 Counting classes are at least as hard as the Polynomial-Time.. (context) - Toda, Ogiwara - 1992
48 A complexity theory based on Boolean algebra (context) - Skyum, Valiant - 1985
44 The Graph Isomorphism Problem: Its Structural Complexity (context) - Kobler, Schoning et al. - 1993
43 Complete sets and the polynomial-time hierarchy (context) - Wrathall - 1977
40 Reductions on NP and P-selective sets (context) - Selman - 1982
34 A uniform approach to define complexity classes (context) - Bovet, Crescenzi et al. - 1992
34 the power of polynomial time bit-reductions (context) - Hertrampf, Lautemann et al. - 1993
34 Relativizable and nonrelativizable theorems in the polynomia.. - Vereshchagin - 1994
29 Logspace and logtime leaf languages - Jenner, McKenzie et al. - 1994
28 unbalanced computation trees (context) - Hertrampf, Vollmer et al. - 1994
27 Complexity classes without machines: On complete languages f.. (context) - Hartmanis, Hemachandra - 1988
23 The Boolean hierarchy: hardware over NP (context) - Cai, Hemachandra - 1994
20 Probabilistic complexity classes and lowness (context) - Schoning - 1987
18 Strong nondeterministic polynomial-time reducibilities (context) - Long - 1982
12 Complexity classes defined by counting quantifiers (context) - Toran - 1991
9 Uniform characterizations of complexity classes - Vollmer - 1999
5 Succinct representations and leaf languages - Veith - 1996
4 th ACM Symposium on Theory of Computing (context) - Simon, Gill et al. - 1977
4 The Satanic notations: Counting classes beyond #P and other .. (context) - Hemaspaandra, Vollmer - 1995
3 th International Colloquium on Automata (context) - Sipser, the et al. - 1982
3 the limitations of locally robust positive reductions (context) - Hemachandra, Jain - 1991
2 A characterization of the leaf language classes - Borchert, Silvestri - 1997
2 ACM Symposium on Theory of Computing (context) - Adleman, Manders et al. - 1977
2 On tally relativizations of BP-complexity classes (context) - Tang, Watanabe - 1989
2 NP is easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
1 A note on complete problems for complexity classes (context) - Ambos-Spies - 1986
1 Strong and robustly strong polynomial time reducibilities to.. (context) - Gavalda, Balc'azar - 1991
Documents on the same site (http://math.uni-heidelberg.de/logic/bb/bbpapers.html): More
On Existentially First-Order Definable Languages and their.. - Borchert, Kuske (1998) (Correct)
A Formal Languages Characterization of NP - Borchert (1999) (Correct)
On the Computational Complexity of some Classical Equivalence.. - Borchert, al. (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