In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a nonâ€¦Â (More)

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

2011

2011

- Guillaume Aucher, Bastien Maubert, FranÃ§ois Schwarzentruber
- Electr. Notes Theor. Comput. Sci.
- 2011

Dynamic Epistemic Logic (DEL) deals with the representation of situations in a multi-agent and dynamic setting. It can express inâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Valentine Kabanets, Russell Impagliazzo
- computational complexity
- 2002

We show that derandomizing Polynomial Identity Testing is, essentially, equivalent to proving circuit lower bounds for <b>NEXP</bâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Carsten Lutz
- IJCAR
- 2001

Concrete domains are an extension of Description Logics (DLs) that allow one to integrate reasoning about conceptual knowledgeâ€¦Â (More)

Is this relevant?

1999

1999

- Wojciech Plandowski
- STOC
- 1999

We prove that the length of a shortest solution of a word equation of length n can bounded by a double exponential function in nâ€¦Â (More)

Is this relevant?

1998

1998

- Pawel Mielniczuk, Leszek Pacholski
- MFCS
- 1998

In this paper we show that satissability of Tarskian set constraints (without recursion) can be decided in exponential time. Thisâ€¦Â (More)

Is this relevant?

1994

1994

- Witold Charatonik, Leszek Pacholski
- FOCS
- 1994

Systems of set constraints describe relations between sets of ground terms. They have been successfully used in program analysisâ€¦Â (More)

Is this relevant?

1994

1994

- Kjartan StefÃ¡nsson
- LICS
- 1994

A system of set constraints is a system of expressions E C F where E and F describe sets of ground terms over a ranked alphabetâ€¦Â (More)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- LÃ¡szlÃ³ Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
- STOC
- 1991

Motivated by Manuel Blumâ€™s concept of inst ante checking, we consider new, very fast and generic mechanisms of checkingâ€¦Â (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
- FOCS
- 1990

A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove thatâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- Juris Hartmanis, Vivian Sewelson, Neil Immerman
- STOC
- 1983

This paper investigates the structural properties of sets in <italic>NP-P</italic> and shows that the computational difficulty ofâ€¦Â (More)

Is this relevant?