Entry Monien:1982:ENT from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Monien:1982:ENT,
author = "B. Monien and I. H. Sudborough",
title = "On eliminating nondeterminism from {Turing} machines
which use less than logarithm worktape space",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "3",
pages = "237--253",
month = dec,
year = "1982",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory)",
corpsource = "Fachbereich Math.-Informatik, Univ. Paderborn,
Paderborn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "graph accessibility problem; graph theory;
nondeterminism; Turing machines; worktape space",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- accessibility,
26(1)25
- C4220,
10(1)19,
10(3)221,
10(3)249,
10(3)273,
11(2)167,
12(2)161,
12(3)333,
13(2)231,
13(3)295,
13(3)315,
13(3)323,
13(3)331,
14(1)39,
14(1)63,
14(1)91,
14(2)155,
14(3)211,
15(2)117,
15(3)311,
16(1)75,
16(2)115,
16(2)187,
16(2)223,
17(1)99,
17(2)229,
17(3)333,
18(1)33,
18(2)207,
19(2)161,
19(2)219,
19(3)253,
19(3)305,
19(3)331,
21(1)27,
21(1)39,
21(2)145,
21(3)255,
22(1)57,
22(1)219,
22(3)297,
23(1)37,
23(1)95,
23(1)103,
23(2)155,
23(2)217,
23(3)231,
23(3)287,
23(3)305,
23(3)333,
24(1)95,
24(1)105,
24(2)123,
24(2)179,
24(3)313,
24(3)331,
25(2)193,
25(3)221,
25(3)311,
26(1)1,
26(1)25,
26(1)197,
26(1)221,
26(1)225,
26(3)327,
26(3)343,
27(1)61,
27(1)121,
27(1)217,
28(1)1,
28(1)223,
28(3)263,
28(3)277,
28(3)315,
28(3)329,
29(1)87,
29(1)123,
30(2)205,
31(3)297,
31(3)317,
32(1)87,
32(1)201,
32(1)221,
32(3)227,
32(3)309,
32(3)321,
32(3)331,
32(3)339,
33(1)3,
33(2)261,
33(2)335,
34(1)157,
34(3)241,
34(3)255
- logarithm,
22(1)71
- nondeterminism,
12(1)19,
23(2)187,
28(1)83
- space,
15(3)311,
16(1)5,
16(2)115,
16(3)329,
17(2)229,
19(2)161,
20(3)323,
21(1)105,
21(2)179,
23(1)95,
23(2)107,
26(1)25,
26(1)197,
27(1)109,
27(1)127,
29(1)155,
31(3)297,
32(1)77,
32(1)221,
34(3)275
- Sudborough, I. H.,
26(1)25
- than,
21(1)39
- Turing,
10(3)221,
10(3)249,
12(2)161,
12(3)333,
13(3)315,
14(1)91,
15(3)311,
16(1)75,
17(2)229,
19(2)161,
19(3)253,
21(2)145,
21(2)179,
21(2)213,
21(3)255,
23(1)37,
23(3)287,
23(3)333,
24(1)105,
24(2)123,
24(3)331,
26(1)25,
26(1)197,
26(3)327,
27(1)61,
28(1)1,
29(1)123,
31(1)101,
32(1)221,
32(3)227,
34(1)17,
34(1)157
- use,
12(1)1
- which,
17(3)303,
31(1)49,
33(2)331
- worktape,
15(3)311