Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PROMISE CLASSES:
Reports tagged with Promise Classes:
TR03-069 | 13th August 2003
Elmar Böhler, Christian Glaßer, Daniel Meister

Small Bounded-Error Computations and Completeness

SBP is a probabilistic promise class located
between MA and AM \cap BPPpath. The first
part of the paper studies the question of whether
SBP has many-one complete sets. We relate
this question to the existence of uniform
enumerations. We construct an oracle relative to
which SBP and AM do ... more >>>


TR05-054 | 19th May 2005
Konstantin Pervyshev

Time Hierarchies for Computations with a Bit of Advice

A polynomial time hierarchy for ZPTime with one bit of advice is proved. That is for any constants a and b such that 1 < a < b, ZPTime[n^a]/1 \subsetneq ZPTime[n^b]/1.

The technique introduced in this paper is very general and gives the same hierarchy for NTime \cap coNTime, UTime, ... more >>>


TR05-111 | 3rd October 2005
Dieter van Melkebeek, Konstantin Pervyshev

A Generic Time Hierarchy for Semantic Models With One Bit of Advice

We show that for any reasonable semantic model of computation and for
any positive integer $a$ and rationals $1 \leq c < d$, there exists a language
computable in time $n^d$ with $a$ bits of advice but not in time $n^c$
with $a$ bits of advice. A semantic ... more >>>


TR07-134 | 14th December 2007
Jeff Kinne, Dieter van Melkebeek

Space Hierarchy Results for Randomized and Other Semantic Models

Revisions: 1

We prove space hierarchy and separation results for randomized and other semantic models of computation with advice. Previous works on hierarchy and separation theorems for such models focused on time as the resource. We obtain tighter results with space as the resource. Our main theorems are the following.

Let <i>s</i>(<i>n</i>) ... more >>>


TR08-107 | 12th November 2008
Zenon Sadowski

Optimal Proof Systems and Complete Languages

We investigate the connection between optimal propositional
proof systems and complete languages for promise classes.
We prove that an optimal propositional proof system exists
if and only if there exists a propositional proof system
in which every promise class with the test set in co-NP
... more >>>


TR09-081 | 27th August 2009
Olaf Beyersdorff, Zenon Sadowski

Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes

In this paper we investigate the following two questions:

Q1: Do there exist optimal proof systems for a given language L?
Q2: Do there exist complete problems for a given promise class C?

For concrete languages L (such as TAUT or SAT and concrete promise classes C (such as NP ... more >>>




ISSN 1433-8092 | Imprint