# Difference between revisions of "Complexity Zoo:H"

m (1 revision: Complexity zoo import.) |
|||

Line 77: | Line 77: | ||

This class was define in [[zooref#ht06|[HT06]]], and it was proved that <math>\Sigma^i_j=\exp_2^{i-1}(n^O(1))^{\Sigma^P_{j-1}}</math> where <math>\Sigma^P_{j-1}</math> is the <math>j</math>th level of the [[Complexity_Zoo:P#ph|polynomial hierarchy]]. | This class was define in [[zooref#ht06|[HT06]]], and it was proved that <math>\Sigma^i_j=\exp_2^{i-1}(n^O(1))^{\Sigma^P_{j-1}}</math> where <math>\Sigma^P_{j-1}</math> is the <math>j</math>th level of the [[Complexity_Zoo:P#ph|polynomial hierarchy]]. | ||

+ | ---- | ||

+ | |||

+ | ===== <span id="hvpzk" style="color:red">HVPZK</span>: Honest-Verifier [[Complexity Zoo:P#pzk|PZK]] ===== | ||

+ | The class of decision problems that have [[Complexity Zoo:P#pzk|PZK]] protocols assuming an honest verifier (i.e. one who doesn't try to learn more about the problem by deviating from the protocol). | ||

+ | |||

+ | Contained in [[Complexity Zoo:P#pp|PP]] [[zooref#bhctv17|[BHCTV17]]]. | ||

+ | There is an oracle where it is not closed under complement [[zooref#bhctv17|[BHCTV17]]]. | ||

---- | ---- | ||

## Revision as of 18:42, 14 November 2020

*Back to the Main Zoo* -
*Complexity Garden* -
*Zoo Glossary* -
*Zoo References*

*Complexity classes by letter:*
Symbols -
A -
B -
C -
D -
E -
F -
G -
H -
I -
J -
K -
L -
M -
N -
O -
P -
Q -
R -
S -
T -
U -
V -
W -
X -
Y -
Z

*Lists of related classes:*
Communication Complexity -
Hierarchies -
Nonuniform

HalfP -
HeurBPP -
HeurBPTIME(f(n)) -
HeurDTIME_{$\delta$}(f(n)) -
HeurP -
HeurPP -
HeurNTIME_{$\delta$}(f(n)) -
H_{k}P -
HVSZK

##### HalfP: RP With Exactly Half Acceptance

The class of decision problems solvable by an NP machine such that

- If the answer is 'yes,' exactly 1/2 of computation paths accept.
- If the answer is 'no,' all computation paths reject.

Significantly, the number of candidate witnesses is restricted to be a power of 2. (This is implicit if they are binary strings.)

Contained in RP, EP, and Mod_{k}P for every odd k. Contained in EQP by the Deutsch-Jozsa algorithm.

Defined in [BB92], where it was called C_{==}P[half]. The name used here is from [BS00]. There it was shown that HalfP is contained in every similar class in which 1/2 is replaced by some other dyadic fraction.

##### HeurBPP: Heuristic BPP

The class of problems for which a 1-1/poly(n) fraction of instances are solvable by a BPP machine.

[FS04] showed a strict hierarchy theorem for HeurBPP; thus, HeurBPP does not equal HeurBPTIME(n^{c}) for any fixed c.

##### HeurBPTIME(f(n)): Heuristic BPTIME(f(n))

The class of problems for which a 1-1/poly(n) fraction of instances are solvable by a BPTIME(f(n)) machine. Thus, HeurBPTIME(f(n)) has the same relationship with BPTIME as HeurDTIME.

Thus HeurBPP is the union of HeurBPTIME(n^{c}) over all c.

##### HeurDTIME_{$\delta$}(f(n)): Heuristic DTIME

For functions and , we say that tuple , where is a language and is a distribution of problem instances, if there exists a heuristic deterministic algorithm such that for all in the support of , runs in time bounded by and with failure probability bounded by [BT06].

##### HeurP: Heuristic P

The class of distributional problems solvable by a P machine. Defined in [Imp95], though he calls the class HP.

Alternately, [BT06] define HeurP as being the set of tuples , where is a language and is a distribution of problem instances, such that there exists an algorithm satisfying two properties:

- For every , for every in the support of , and for every , runs in time bounded by .
- For every , is a heuristic algorithm for whose error probability is bounded by .

##### HeurPP: Heuristic PP

The class of distributional problems solvable by a PP machine. Defined in [Ill95], though he calls the class HPP.

##### HeurNTIME_{$\delta$}(f(n)): Heuristic NTIME

Defined as Heur_{$\delta$}DTIME, but for non-deterministic heuristic algorithms.

NP is not contained in HeurNTIME_{$1/2+1/{n^{a}}$}() for any constants [Per07].

##### H_{k}P: High Hierarchy In NP

The class of problems A in NP such that Σ_{k}P^{A} = Σ_{k+1}P; that is, adding A as an oracle increases the power of the k^{th} level of the polynomial hierarchy by a maximum amount.

For all k, H_{k} is contained in H_{k+1}.

H_{0} consists exactly of the problems complete for NP under Cook reductions.

H_{1} consists exactly of the problems complete for NP under strong non-deterministic Turing reductions [Sch83].

Defined in [Sch83].

See also L_{k}P.

##### HO: High-Order logic

High order logic is an extension of Second order, First order where we add quantification over higher order variables.

We define a relation of order and arity to be a subset of -tuple of relation of order and arity . When it is by extension a first order variable. The quantification of formula in HO is over a given order (which is a straightforward extension of SO where we add quantification over constant (first-order variable) and relation (second-order variables). The atomic predicates now can be general application of relation of order and arity to relations of order and arity and test of equality between two relations of the same order and arity.

is the set of formulae with quantification up to order O. (resp. ) is defined as the set of formula in beginning by an existantial (resp universal) quantifier followed by at most alternation of quantifiers.

This class was define in [HT06], and it was proved that where is the th level of the polynomial hierarchy.

##### HVPZK: Honest-Verifier PZK

The class of decision problems that have PZK protocols assuming an honest verifier (i.e. one who doesn't try to learn more about the problem by deviating from the protocol).

Contained in PP [BHCTV17]. There is an oracle where it is not closed under complement [BHCTV17].

##### HVSZK: Honest-Verifier SZK

The class of decision problems that have SZK protocols assuming an honest verifier (i.e. one who doesn't try to learn more about the problem by deviating from the protocol).