In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes, which is an exponential time analogue of the… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Martin Lück
- ArXiv
- 2016

Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems… (More)

Is this relevant?

2016

2016

- Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema
- GandALF
- 2016

We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency… (More)

Is this relevant?

2007

2007

- A. Pavana, Alan L. Selmanb, Samik Senguptab, N. V. Vinodchandranc
- 2007

If every language in coNP has a constant-round interactive proof system, then the polynomial-time hierarchy collapses [R.B… (More)

Is this relevant?

2004

2004

- Alan L. Selman, Samik Sengupta
- Electronic Colloquium on Computational Complexity
- 2004

It is known [BHZ87] that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy… (More)

Is this relevant?

2000

2000

- Pat Berglund
- 2000

It is shown that non-supersymmetric spacetime varying string vacua can lead to an exponential hierarchy between the electroweak… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

We propose a new higher-dimensional mechanism for solving the hierarchy problem. The weak scale is generated from a large scale… (More)

Is this relevant?

1999

1999

- Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe
- COCOON
- 1999

Lower bounds on circuit size were previously established for functions in Σp2, ZPP , Σ exp 2 , ZPEXP NP and MAexp. We investigate… (More)

Is this relevant?

1996

1996

- Sarah Mocas
- Theor. Comput. Sci.
- 1996

We are interested in separating classes in the exponential time hierarchy, EXPH, from classes in the polynomial time hierarchy… (More)

Is this relevant?

1992

1992

- Harry Buhrman, Steven Homer
- FSTTCS
- 1992

Several problems concerning superpolynomial size circuits and superpolynomial-time advice classes are investigated. First we… (More)

Is this relevant?

1987

1987

- Lane A. Hemaspaandra
- STOC
- 1987

The polynomial hierarchy, composed of the levels P, NP, P<supscrpt>NP</supscrpt>, NP<supscrpt>NP</supscrpt>, etc., plays a… (More)

Is this relevant?