Entry Wagner:1986:SOC from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Wagner:1986:SOC,
author = "K. W. Wagner",
title = "Some observations on the connection between counting
and recursion",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "131--147",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Inst. fur Math., Augsburg Univ., West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "accepting computations; class P; class PSPACE;
computational complexity; counting functions;
nondeterministic polynomial-time Turing machines; PHCF;
polynomial-time computable functions; polynomial-time
hierarchy; recursion theory; recursive functions;
Turing machines",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
Related entries
- accepting,
61(2)137
- class,
35(1)17,
35(2)313,
37(2)123,
38(2)143,
38(2)157,
39(2)267,
40(1)57,
41(1)105,
42(2)123,
43(2)213,
44(2)237,
46(2)313,
47(1)1,
47(1)39,
47(1)71,
47(1)99,
47(2)111,
47(3)247,
47(3)263,
48(2)145,
48(2)329,
52(3)177,
52(3)251,
54(1)87,
58(1)129,
60(3)255,
61(1)17,
61(2)103,
63(1)43,
64(2)203,
67(1)75,
67(1)99,
67(2)143,
67(2)283,
68(2)155
- computable,
39(2)225,
43(2)251,
46(2)285,
47(3)263,
47(3)299,
50(2)137,
51(1)177,
54(2)341,
65(1)85,
66(2)117
- computation,
35(2)191,
36(1)1,
36(1)127,
39(2)107,
40(2)211,
40(2)275,
40(2)323,
41(2)325,
43(2)149,
44(1)1,
46(2)159,
46(2)319,
47(1)39,
47(2)111,
47(2)205,
47(3)315,
48(2)257,
49(2)171,
52(3)193,
52(3)251,
53(1)125,
53(2)201,
53(2)267,
54(1)65,
57(2)327,
58(1)347,
59(1)25,
59(1)133,
59(3)277,
59(3)297,
60(3)231,
60(3)297,
62(1)187,
62(3)311,
64(1)55,
64(3)221,
67(1)99,
68(1)19,
68(3)267,
68(3)277
- connection,
53(1)3,
64(2)191
- counting,
36(2)345,
43(2)169,
49(2)283,
58(1)81,
58(1)129,
62(1)187
- hierarchy,
40(2)175,
43(1)107,
43(2)169,
47(1)39,
48(1)109,
48(2)153,
49(1)1,
49(2)217,
51(1)53,
53(2)201,
54(1)87,
56(3)289,
58(1)175,
58(1)263,
61(2)175,
62(1)39,
65(3)271,
67(1)99,
68(1)113
- nondeterministic,
36(1)1,
36(1)21,
36(1)127,
37(1)1,
39(1)27,
39(2)89,
40(2)175,
40(2)211,
41(2)141,
41(2)305,
43(2)123,
45(1)1,
45(2)193,
47(2)111,
47(2)149,
47(3)335,
48(1)109,
48(2)153,
48(2)329,
49(2)87,
49(2)185,
51(3)325,
52(3)177,
52(3)307,
52(3)341,
54(2)331,
56(1)37,
58(1)69,
58(1)175,
58(1)249,
61(2)137,
61(2)149,
62(3)319,
63(2)203,
64(3)221,
67(1)111,
68(3)277
- observation,
35(1)43,
36(1)21,
49(2)87,
49(2)z,
53(2)225,
60(1)1,
66(1)45
- P,
35(1)109,
46(2)197
- polynomial-time,
47(3)263,
51(3)265,
52(1)77,
56(3)289,
61(2)307,
68(3)267,
68(3)319
- recursion,
38(1)17,
38(1)35,
45(2)193,
54(1)29,
58(1)249,
59(3)211,
66(3)255
- recursive,
35(2)227,
35(2)261,
36(1)1,
37(1)77,
38(1)17,
38(1)35,
39(1)15,
39(2)207,
40(2)323,
41(1)33,
41(2)289,
42(1)1,
42(2)123,
42(3)251,
44(3)307,
45(1)1,
45(2)193,
46(2)239,
47(2)121,
47(3)299,
51(1)129,
52(3)281,
53(1)25,
53(1)z,
54(1)29,
57(2)327,
60(1)83,
60(3)297,
61(2)103,
62(0)3,
62(1)187,
62(3)289,
63(1)43,
63(3)253,
66(3)255,
66(3)289,
66(3)333,
68(3)303,
69(1)1
- time, polynomial-,
47(3)263,
51(3)265,
52(1)77,
56(3)289,
61(2)307,
68(3)267,
68(3)319
- Turing,
35(2)191,
35(2)215,
36(2)341,
37(1)1,
40(2)175,
41(2)331,
43(1)43,
43(1)107,
44(1)1,
44(1)111,
47(3)237,
51(3)265,
52(1)15,
52(3)251,
52(3)341,
53(2)307,
54(2)325,
54(2)331,
55(2)291,
57(1)47,
58(1)175,
58(1)263,
61(2)149,
66(3)289,
67(1)5,
67(1)99,
68(1)19,
68(2)123
- Wagner, K. W.,
51(1)53