Entry Linial:1985:DHC 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{Linial:1985:DHC,
author = "N. Linial and M. Tarsi",
title = "Deciding hypergraph $2$-colourability by
{H}-resolution",
journal = j-THEOR-COMP-SCI,
volume = "38",
number = "2--3",
pages = "343--347",
month = jun,
year = "1985",
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 = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Inst. of Math. and Comput. Sci., Hebrew Univ.,
Jerusalem, Israel",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Boolean formulas; computational problem; graph
colouring; H-resolution; hypergraph 2-colourability
deciding; propositional calculus; satisfiability
problem",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}
Related entries
- $2$,
46(2)107,
62(3)267
- B0250,
36(2)319,
38(1)123,
38(2)249,
38(2)293,
40(2)329,
41(2)141,
41(2)185,
41(2)325,
43(1)99,
45(3)261,
48(1)95,
53(2)201,
53(2)281,
54(2)181,
54(2)215,
54(2)237,
54(2)341,
55(1)87,
56(2)223,
56(2)233,
57(1)153,
58(1)103,
58(1)209,
58(1)325,
61(2)175,
61(2)307,
61(2)317,
64(1)25,
64(1)67,
64(1)97,
64(1)119,
65(2)149,
65(2)153,
68(1)89
- 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,
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,
52(3)239,
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
- calculus,
37(3)245,
39(2)135,
39(2)297,
41(1)95,
44(1)51,
44(2)127,
45(2)121,
45(3)293,
46(1)67,
48(1)95,
52(1)1,
52(1)145,
52(3)205,
52(3)307,
53(2)335,
56(2)223,
58(1)143,
59(1)25,
59(1)85,
59(1)181,
59(3)317,
60(3)297,
64(1)55,
65(3)291,
67(1)129,
68(1)105,
68(3)333,
69(1)55
- colouring,
43(2)337,
68(1)89
- deciding,
58(1)263,
67(1)19
- formula,
38(2)307,
39(2)155,
41(2)271,
46(1)91,
49(1)1,
52(3)281,
54(2)165,
57(1)97,
58(1)347,
59(1)115,
61(2)307,
62(3)311,
65(2)153,
66(1)113,
68(1)113,
68(2)123
- hypergraph,
0(0)0
- propositional,
36(1)71,
39(2)297,
49(2)217,
55(1)1,
59(1)115,
61(2)259,
62(3)311,
66(1)87,
68(1)113,
68(2)123
- satisfiability,
40(2)195,
52(1)145,
61(2)307,
67(2)303,
68(1)113,
68(2)123