Entry Beigel:1991:BQS 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{Beigel:1991:BQS,
author = "R. Beigel",
title = "Bounded queries to {SAT} and the {Boolean} hierarchy",
journal = j-THEOR-COMP-SCI,
volume = "84",
number = "2",
pages = "199--223",
day = "29",
month = jul,
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 = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Johns Hopkins Univ., Baltimore,
MD, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean hierarchy; bounded NP query hierarchies;
computational complexity; decision problems complexity;
deterministic polynomial time; languages; mind-change
technique; NP oracle; NP set; P=NP; parallel queries;
polynomial-time Turing machine; SAT; serial queries;
Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Beigel, R.,
73(3)249,
103(1)3
- 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,
82(1)141,
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
- bounded,
70(2)261,
72(1)65,
74(3)313,
76(1)143,
80(2)289,
82(1)1,
82(1)51,
84(1)53,
84(2)265,
87(2)287,
94(1)125,
97(1)1,
100(2)347,
101(2)161,
102(1)185,
112(2)419,
117(1)137,
119(1)187,
123(1)139,
132(1)85,
133(1)165
- decision,
71(3)281,
72(1)39,
72(2)265,
74(1)71,
80(2)227,
81(1)137,
81(2)169,
82(1)19,
84(1)127,
85(1)33,
93(2)279,
95(1)115,
98(1)137,
98(1)z,
106(2)351,
107(1)63,
110(2)419,
112(1)145,
112(2)371,
113(1)119,
118(2)193,
119(1)173,
120(2)197,
123(2)183,
125(2)339,
126(2)183,
127(1)25,
128(1)179,
133(2)307,
134(2)329,
134(2)365,
134(2)387,
135(1)139
- hierarchy,
73(3)313,
80(2)203,
81(1)77,
83(1)97,
83(2)313,
83(2)323,
85(2)305,
88(2)297,
91(1)71,
95(1)97,
96(2)325,
96(2)345,
97(2)183,
98(2)249,
98(2)289,
100(1)45,
101(2)289,
102(2)215,
104(2)235,
106(2)283,
112(2)339,
112(2)413,
113(1)167,
115(2)225,
115(2)261,
116(1)33,
119(2)293,
120(2)293,
123(2)239,
125(2)355,
127(1)123,
129(2)323,
132(1)1,
134(2)263,
134(2)287
- NP,
81(2)189,
83(2)337,
85(1)1,
88(1)183,
97(2)183,
99(2)279,
103(1)3,
107(1)145,
133(1)15,
133(1)95
- oracle,
74(2)217,
74(3)325,
75(3)335,
81(1)35,
81(1)77,
82(1)1,
82(1)51,
82(2)329,
88(1)1,
88(2)231,
92(2)301,
92(2)309,
93(2)265,
97(2)183,
99(2)279,
102(2)215,
107(1)95,
120(1)69,
127(1)99,
132(1)435,
134(2)545
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- query,
72(2)147,
73(2)213,
73(3)249,
74(1)95,
76(1)3,
76(1)93,
76(2)223,
77(3)291,
78(1)3,
78(1)137,
78(1)159,
78(1)217,
78(1)z,
82(1)51,
83(2)313,
85(1)75,
86(1)35,
87(2)263,
93(2)201,
97(1)143,
101(1)143,
104(2)207,
116(1)33,
116(1)59,
116(1)95,
116(1)117,
116(1)151,
116(1)195,
116(2)359,
120(1)45,
129(2)397,
130(1)139,
133(2)267,
133(2)421,
134(2)287
- serial,
81(1)97
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)199,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473