Stem nexptim$ (all stems)

5 papers:

LICS-2015-CzerwinskiJ #branch #process #similarity

Branching Bisimilarity of Normed BPA Processes Is in NEXPTIME (WC, PJ), pp. 168–179.

IJCAR-2001-Lutz #logic

NEXPTIME-Complete Description Logics with Concrete Domains (CL), pp. 45–60.

STOC-1999-Plandowski #equation #satisfiability #word

Satisfiability of Word Equations with Constants is in NEXPTIME (WP), pp. 721–725.

LICS-1994-Stefansson #constraints #set

Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete (KS), pp. 137–141.

STOC-1983-HartmanisSI #set

Sparse Sets in NP-P: EXPTIME versus NEXPTIME (JH, VS, NI), pp. 382–391.