Entry Robson:1991:LRR from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
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{Robson:1991:LRR,
author = "J. M. Robson",
title = "An {O}({T} log {T}) reduction from {RAM} computations
to satisfiability",
journal = j-THEOR-COMP-SCI,
volume = "82",
number = "1",
pages = "141--149",
day = "22",
month = may,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Dept of Comput. Sci., Australian Nat. Univ., Canberra,
ACT, Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "accepting computation; Boolean algebra; Boolean
expression; computational complexity; nondeterministic
Turing machine; RAM computations; random access
machines; satisfiability; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- accepting,
103(1)3,
110(1)1,
112(2)255,
127(1)171
- access,
71(3)401,
74(2)183,
74(2)217,
87(2)251,
100(1)1,
107(1)77,
107(1)135,
132(1)377
- boolean,
70(2)251,
74(3)313,
76(2)261,
79(1)25,
80(1)53,
80(1)77,
81(1)117,
81(2)257,
82(1)113,
84(2)199,
88(1)139,
91(1)71,
93(2)227,
93(2)303,
97(2)285,
98(2)289,
99(2)243,
100(1)137,
101(1)133,
102(2)307,
103(1)25,
107(1)121,
108(2)271,
112(2)291,
113(1)167,
115(1)77,
116(2)399,
116(2)415,
118(2)167,
121(1)9,
121(1)411,
124(2)273,
126(1)3,
126(2)183,
126(2)237,
133(1)35,
134(1)51,
134(1)79,
135(1)139,
136(2)419,
182(1)257
- expression,
74(2)199,
74(3)273,
74(3)329,
75(1)85,
76(2)273,
77(1)97,
77(3)291,
78(1)113,
82(2)403,
84(2)225,
85(2)283,
87(1)81,
88(2)351,
89(2)207,
91(1)101,
92(1)19,
96(2)285,
97(2)217,
107(2)209,
108(2)291,
116(1)33,
120(2)197,
124(1)127,
127(2)287,
128(1)211,
134(1)27
- log,
77(3)221,
132(1)1
- nondeterministic,
74(1)115,
74(2)217,
75(3)289,
77(3)221,
78(1)137,
81(2)317,
82(2)389,
84(2)165,
85(1)53,
85(2)305,
88(1)1,
88(1)15,
88(1)99,
88(2)269,
88(2)297,
90(1)151,
91(2)129,
93(1)43,
97(2)183,
101(1)99,
101(2)161,
103(1)3,
106(2)351,
107(1)95,
107(2)305,
108(2)393,
115(2)225,
118(1)49,
118(1)67,
119(1)215,
120(1)123,
120(2)197,
125(2)243,
125(2)295,
127(1)171,
129(2)323,
129(2)337,
132(1)319,
133(1)3,
133(2)341,
134(1)253,
134(2)545,
135(1)139
- RAM,
73(3)313,
85(1)53,
95(2)323,
127(1)53,
130(1)85
- random,
71(3)401,
81(1)117,
92(2)301,
93(2)201,
100(1)1,
107(1)135,
112(2)383,
127(2)333,
132(1)1,
132(1)377
- reduction,
72(2)133,
81(2)189,
88(1)1,
88(2)269,
89(2)207,
92(1)3,
93(1)75,
96(2)305,
97(2)245,
98(1)137,
99(1)1,
100(1)205,
103(2)283,
104(1)109,
107(1)145,
107(2)333,
108(2)185,
111(1)145,
115(2)261,
115(2)371,
118(2)193,
121(1)279,
123(1)95,
123(2)407,
126(2)259,
127(1)99,
127(1)149,
131(2)441,
132(1)179,
132(1)229,
132(1)403,
135(1)67,
135(1)111,
135(1)z
- Robson, J. M.,
73(3)313,
106(2)327
- satisfiability,
72(2)265,
72(2)z,
81(1)49,
81(1)65,
94(1)101,
105(1)141,
116(2)405,
129(1)95,
134(2)287
- T,
100(1)45