Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: 2-EXPTIME (view), NEXPTIME (view)

searching for EXPTIME 5 found (56 total)

alternate case: eXPTIME

Object pool pattern (2,410 words) [view diff] case mismatch in snippet view article find links to article

temp3 = temp3; } } public class PooledObjectPool { private static long expTime = 6000;//6 seconds public static HashMap<PooledObject, Long> available

Checkers (3,295 words) [view diff] exact match in snippet view article find links to article

thus it is PSPACE-complete. However, without this bound, Checkers is EXPTIME-complete. However, other problems have only polynomial complexity: Can

Sparse language (595 words) [view diff] exact match in snippet view article find links to article

Juris Hartmanis, Neil Immerman, Vivian Sewelson. Sparse Sets in NP-P: EXPTIME versus NEXPTIME. Information and Control, volume 65, issue 2/3, pp.158–181

DatalogZ (500 words) [view diff] exact match in snippet view article find links to article

doi:10.1145/502807.502810. ISSN 0360-0300.. "For example, datalog (which is EXPTIME-complete) with linear arithmetic constraints [...] is undecidable." (Theorem

Dynamic epistemic logic (8,001 words) [view diff] exact match in snippet view article find links to article

n = 1 {\displaystyle n=1} n ≥ 2 {\displaystyle n\geq 2} with common knowledge K, S4 PSPACE PSPACE EXPTIME KD45 NP PSPACE EXPTIME S5 NP PSPACE EXPTIME