Entry Ogiwara:1993:SHS 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{Ogiwara:1993:SHS,
author = "Mitsunori Ogiwara and Antoni Lozano",
title = "On sparse hard sets for counting classes",
journal = j-THEOR-COMP-SCI,
volume = "112",
number = "2",
pages = "255--275",
day = "10",
month = may,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:11 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=112&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=112&issue=2&aid=1222",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4220 (Automata
theory); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci. and Inf. Maths., Univ. of
Electro-Commun., Tokyo, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "accepting paths; complete sets; complexity classes;
computational complexity; counting classes;
one-word-decreasing self-reducible sets; predicate;
self-reducibility machine; set theory; sparse hard
sets; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- accepting,
82(1)141,
103(1)3,
110(1)1,
127(1)171
- complete,
70(1)127,
70(2)233,
71(3)347,
72(2)265,
74(1)3,
75(1)85,
75(1)z,
75(3)357,
76(2)179,
80(2)203,
81(1)1,
83(2)337,
85(1)75,
87(1)1,
88(1)33,
88(1)83,
89(2)207,
91(1)101,
94(2)281,
96(2)305,
97(2)183,
98(1)27,
98(1)z,
100(2)365,
102(1)135,
104(2)263,
111(1)125,
111(1)z,
114(1)63,
114(2)231,
118(2)167,
118(2)315,
119(1)127,
119(1)z,
120(1)83,
121(1)351,
122(1)97,
124(1)1,
129(2)309,
130(1)203,
131(1)95,
131(2)311,
132(1)229,
133(2)205,
134(1)27,
136(2)487,
136(2)507
- counting,
79(1)37,
81(1)49,
81(1)77,
85(1)171,
86(2)325,
100(1)243,
102(2)283,
103(1)3,
107(1)3,
108(1)3,
108(2)371,
117(1)45,
117(1)203,
133(1)105
- hard,
107(1)3,
115(2)277
- path,
72(2)251,
72(2)z,
74(2)199,
74(3)355,
79(1)151,
79(1)179,
83(2)189,
84(1)127,
84(2)179,
84(2)281,
88(1)33,
88(1)151,
89(1)33,
94(1)141,
95(2)245,
100(1)243,
102(2)329,
105(1)129,
106(2)391,
115(2)351,
116(2)359,
117(1)137,
117(1)187,
117(1)203,
125(2)345,
127(2)395,
131(1)1,
133(1)65
- predicate,
71(2)265,
75(1)111,
76(1)3,
76(1)115,
87(1)143,
89(1)63,
90(2)309,
93(2)169,
95(1)115,
100(2)365,
101(1)133,
101(2)337,
102(1)207,
104(1)109,
105(1)27,
107(2)277,
111(1)59,
111(1)z,
116(1)151,
118(2)99,
122(1)119,
123(2)341,
124(2)221,
124(2)297,
131(1)121
- reducibility, self-,
81(2)189,
88(1)183
- reducible, self-,
88(1)183
- self-reducibility,
81(2)189,
88(1)183
- self-reducible,
88(1)183
- sparse,
82(1)51,
84(2)151,
86(2)325,
88(1)1,
92(1)165,
93(2)265,
97(2)199,
99(2)279,
134(2)263