Entry Milano:2000:SSP from lncs2000.bib
Last update: Thu May 16 02:07:42 MDT 2019
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{Milano:2000:SSP,
author = "Michela Milano and Andrea Roli",
title = "Solving the Satisfiability Problem through {Boolean}
Networks",
journal = j-LECT-NOTES-COMP-SCI,
volume = "1792",
pages = "72--??",
year = "2000",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Fri Feb 1 09:16:16 MST 2002",
bibsource = "http://link.springer-ny.com/link/service/series/0558/tocs/t.htm;
http://www.math.utah.edu/pub/tex/bib/lncs2000.bib",
URL = "http://link.springer-ny.com/link/service/series/0558/bibs/1792/17920072.htm;
http://link.springer-ny.com/link/service/series/0558/papers/1792/17920072.pdf",
acknowledgement = ack-nhfb,
}
Related entries
- Boolean,
1770(0)157,
1782(0)200,
1807(0)485,
1807(0)507,
1851(0)504,
1861(0)553,
1880(0)515,
1919(0)179,
1977(0)1,
1977(0)19,
2125(0)258
- Network,
1731(0)107,
1731(0)232,
1731(0)250,
1752(0)182,
1765(0)151,
1765(0)179,
1765(0)401,
1770(0)651,
1783(0)222,
1792(0)25,
1792(0)37,
1792(0)143,
1800(0)1,
1800(0)28,
1800(0)210,
1800(0)415,
1800(0)678,
1800(0)743,
1800(0)800,
1800(0)1248,
1800(0)1266,
1800(0)1281,
1800(0)1286,
1800(0)1296,
1807(0)102,
1818(0)14,
1818(0)31,
1818(0)47,
1818(0)82,
1818(0)92,
1818(0)108,
1822(0)267,
1822(0)326,
1822(0)357,
1839(0)8,
1839(0)534,
1839(0)647,
1851(0)300,
1851(0)535,
1853(0)768,
1857(0)157,
1857(0)240,
1857(0)372,
1864(0)260,
1864(0)324,
1905(0)132,
1905(0)266,
1908(0)9,
1908(0)289,
1909(0)137,
1909(0)147,
1909(0)170,
1910(0)96,
1910(0)309,
1910(0)440,
1910(0)516,
1911(0)174,
1914(0)104,
1914(0)253,
1914(0)283,
1919(0)269,
1923(0)348,
1928(0)13,
1928(0)95,
1928(0)127,
1928(0)137,
1928(0)172,
1931(0)1,
1931(0)17,
1931(0)67,
1931(0)95,
1931(0)139,
1931(0)151,
1932(0)266,
1933(0)4,
1933(0)122,
1940(0)218,
1940(0)230,
1940(0)260,
1940(0)292,
1940(0)300,
1940(0)336,
1940(0)501,
1954(0)505,
1961(0)13,
1961(0)43,
1961(0)69,
1961(0)263,
1974(0)94,
1975(0)262,
1983(0)126,
1983(0)158,
1983(0)262,
1983(0)286,
1983(0)344
- Satisfiability,
1861(0)553,
1861(0)822,
1864(0)233
- Solving,
1753(0)200,
1753(0)293,
1754(0)124,
1755(0)93,
1755(0)424,
1767(0)277,
1770(0)290,
1792(0)380,
1800(0)314,
1800(0)423,
1800(0)595,
1807(0)19,
1807(0)392,
1822(0)369,
1839(0)33,
1839(0)133,
1839(0)232,
1839(0)393,
1839(0)403,
1849(0)239,
1861(0)747,
1866(0)147,
1923(0)389,
1932(0)237,
1955(0)225,
1955(0)399,
1955(0)451
- through,
1737(0)211,
1765(0)165,
1765(0)326,
1792(0)356,
1800(0)612,
1816(0)258,
1835(0)196,
1849(0)169,
1849(0)277,
1857(0)167,
1858(0)447,
1861(0)867,
1864(0)247,
1877(0)1,
1880(0)300,
1883(0)265,
1902(0)339,
1902(0)415,
1907(0)1,
1910(0)325,
1910(0)524,
1915(0)57,
1915(0)246,
1923(0)229,
1937(0)352,
1954(0)505,
1983(0)380