Entry Nigmatullin:1987:MLB 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{Nigmatullin:1987:MLB,
author = "R. G. Nigmatullin",
title = "Models of lower-bounds proofs",
journal = j-THEOR-COMP-SCI,
volume = "52",
number = "3",
pages = "239--249",
month = "????",
year = "1987",
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); C4240 (Programming and
algorithm theory)",
corpsource = "Kazan State Univ., USSR",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean circuits; Boolean functions; complexity;
computational complexity; effective proofs; function
width; high lower bounds; lower bounds;
superpolynomials; theorems; theoretical cybernetics",
pubcountry = "Netherlands A04",
treatment = "T Theoretical or Mathematical",
}
Related entries
- boolean,
35(2)313,
36(1)59,
36(1)119,
36(2)239,
36(2)291,
36(2)333,
38(1)55,
38(1)133,
38(2)343,
40(2)275,
43(1)43,
43(2)201,
44(2)127,
44(3)247,
47(1)61,
47(3)237,
48(1)53,
49(1)1,
51(1)53,
52(1)59,
53(2)267,
54(1)65,
55(2)291,
56(3)345,
57(1)97,
57(1)113,
59(1)85,
61(2)307,
64(3)271,
64(3)331,
66(1)15,
66(1)113,
68(1)19
- bound,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
41(2)331,
43(2)201,
44(3)247,
45(1)63,
46(2)107,
46(2)329,
47(2)111,
47(2)149,
47(3)323,
49(2)171,
49(2)217,
52(3)251,
54(2)325,
56(2)211,
57(1)97,
57(1)113,
58(1)175,
58(1)263,
60(3)285,
61(2)149,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(1)1,
66(1)105,
66(2)137,
67(1)55,
67(1)115,
69(3)319
- circuit,
36(2)239,
36(2)333,
38(1)55,
38(2)269,
41(2)141,
43(2)201,
43(2)277,
57(0)3,
57(1)97,
57(1)113,
61(1)49,
64(1)125,
64(3)271,
68(1)19,
68(1)113,
68(3)267
- cybernetics,
58(1)155
- effective,
37(2)151,
45(3)293
- high,
54(1)3,
56(1)3,
60(2)177
- lower,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
43(2)201,
44(3)247,
46(2)329,
47(2)149,
47(3)323,
49(2)171,
52(3)251,
54(2)325,
57(1)97,
57(1)113,
58(1)263,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(2)137,
67(1)115
- model,
35(2)191,
37(1)77,
37(3)269,
37(3)305,
39(1)47,
39(2)107,
40(2)149,
40(2)275,
42(2)123,
43(2)213,
44(1)1,
45(1)1,
45(2)159,
47(2)111,
48(1)95,
48(1)109,
48(2)229,
48(2)297,
49(2)171,
49(2)267,
49(2)283,
51(1)129,
52(3)193,
52(3)251,
54(1)65,
56(2)187,
58(1)249,
59(1)85,
59(3)277,
60(2)109,
60(3)297,
61(1)49,
61(2)149,
61(2)199,
62(3)251,
63(1)63,
63(2)203,
64(3)221,
64(3)305,
65(1)85,
66(0)117,
66(2)205,
68(1)19,
68(2)203,
68(3)343,
69(1)1,
69(3)289
- proof,
35(2)345,
36(2)251,
39(1)27,
39(1)47,
39(1)z,
41(1)121,
42(2)123,
43(1)91,
43(2)345,
44(2)127,
44(3)333,
46(2)261,
46(2)305,
48(2)229,
50(3)241,
52(3)281,
54(2)199,
57(2)161,
57(2)317,
59(3)317,
61(2)225,
62(3)311,
63(1)91,
65(1)1,
65(1)35,
65(2)149,
66(1)87,
67(1)87,
67(2)203,
68(2)123,
68(3)267,
68(3)333,
69(1)69,
69(3)243
- theorem,
35(2)129,
37(1)51,
37(1)77,
37(2)183,
38(1)123,
38(1)137,
38(2)143,
39(2)135,
39(2)155,
43(1)91,
43(1)99,
43(2)315,
44(2)127,
44(3)333,
46(2)305,
47(1)1,
48(1)1,
48(2)183,
48(2)201,
49(1)1,
49(2)283,
51(1)117,
52(1)1,
52(1)145,
52(3)205,
53(1)125,
53(2)169,
54(1)3,
54(1)29,
54(2)249,
56(3)277,
57(2)161,
57(2)239,
59(1)133,
59(3)287,
61(1)17,
61(2)279,
64(1)1,
64(1)15,
64(3)331,
65(2)149,
65(3)271,
67(2)173,
67(2)203,
68(1)89,
68(3)277,
69(3)243
- theoretical,
38(1)35,
39(1)z,
48(1)75,
66(3)247