Find link

language:

jump to random article

view article
Find link is a tool written by Edward Betts.

searching for Neil Immerman 3 found (29 total)

alternate case: neil Immerman

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

Complexity II. Springer. pp. 130–131. ISBN 3-540-52079-1. Juris Hartmanis, Neil Immerman, Vivian Sewelson. Sparse Sets in NP-P: EXPTIME versus NEXPTIME. Information
NEXPTIME (1,065 words) [view diff] exact match in snippet view article find links to article
variables is NEXPTIME-complete. Game complexity NP EXPTIME Juris Hartmanis, Neil Immerman, Vivian Sewelson. Sparse Sets in NP-P: EXPTIME versus NEXPTIME. Information
Parallel RAM (1,275 words) [view diff] exact match in snippet view article find links to article
196 (1): 153–180. doi:10.1016/S0304-3975(97)00199-0. ISSN 0304-3975. Neil Immerman, Expressibility and parallel complexity. SIAM Journal on Computing,