Entry Lengauer:1990:BNF 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{Lengauer:1990:BNF,
author = "T. Lengauer and K. W. Wagner",
title = "The binary network flow problem is logspace complete
for {P}",
journal = j-THEOR-COMP-SCI,
volume = "75",
number = "3",
pages = "357--363",
day = "01",
month = oct,
year = "1990",
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 = "Univ.-GH Paderborn, West Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "acyclic graphs; binary network flow problem;
computational complexity; edge capacities; graph
theory; logspace complete; logspace Turing complete;
many-one complete; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- acyclic,
78(2)363,
86(1)81,
86(1)z,
88(1)33,
92(1)181,
92(1)z,
94(1)63,
95(2)245,
110(1)197,
119(2)331,
123(2)389
- binary,
71(1)3,
77(1)131,
77(3)267,
79(2)323,
83(2)249,
85(1)75,
87(1)25,
88(1)83,
88(2)365,
93(2)201,
93(2)321,
102(2)253,
106(2)265,
106(2)361,
108(2)291,
112(2)383,
114(2)247,
115(2)243,
117(1)99,
117(1)203,
118(1)49,
119(1)39,
120(1)1,
120(2)215,
123(2)291,
124(2)221,
125(2)259,
132(1)1,
132(1)37,
132(1)129,
133(2)387,
136(2)507
- complete,
70(1)127,
70(2)233,
71(3)347,
72(2)265,
74(1)3,
75(1)85,
75(1)z,
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,
112(2)255,
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
- edge,
71(3)401,
74(3)299,
84(2)179,
86(2)205,
102(2)283,
112(2)371,
112(2)419,
116(1)151,
127(2)395,
128(1)241,
131(2)361
- flow,
75(3)347,
91(2)129,
104(2)285,
106(2)243,
116(2)359
- logspace,
107(1)135
- many-one,
81(2)189,
97(2)199,
115(2)371,
132(1)229
- network,
73(1)61,
74(1)19,
76(2)331,
80(2)337,
84(1)23,
86(2)343,
87(1)43,
90(2)355,
91(1)57,
91(2)129,
100(1)223,
102(2)329,
102(2)355,
104(2)285,
107(2)305,
108(2)291,
116(2)359,
116(2)415,
120(2)215,
120(2)261,
124(2)329,
125(1)45,
125(1)61,
125(1)111,
125(1)149,
125(2)373,
127(2)313,
127(2)395,
128(1)31,
128(1)63,
128(1)127,
130(1)49,
130(1)73,
130(1)175,
131(2)331,
132(1)113,
134(1)51
- one, many-,
81(2)189,
97(2)199,
115(2)371,
132(1)229
- P,
80(2)263,
88(1)183,
93(1)1,
97(2)183,
133(1)15,
133(1)95