Entry Kossovsky:1992:PCC from lncs1992.bib
Last update: Fri Mar 23 02:19:00 MDT 2018
Top |
Symbols |
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{Kossovsky:1992:PCC,
author = "N. K. Kossovsky and A. B. Prokhoroff",
title = "The Polynomial Complexity of Conjunctive Normal Form
Satisfiability, when the Number of Conjunctions and
Negations is Limited",
journal = j-LECT-NOTES-COMP-SCI,
volume = "620",
pages = "241--??",
year = "1992",
CODEN = "LNCSD9",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Mon May 13 11:46:24 MDT 1996",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs1992.bib",
acknowledgement = ack-nhfb,
}
Related entries
- complexity,
570(0)85,
570(0)97,
570(0)209,
594(0)309,
601(0)12,
601(0)79,
607(0)139,
613(0)228,
621(0)165,
623(0)16,
623(0)439,
623(0)509,
626(0)96,
626(0)339,
629(0)50,
629(0)82,
629(0)112,
629(0)142,
629(0)172,
629(0)181,
629(0)227,
634(0)845,
650(0)175,
650(0)187,
650(0)229,
650(0)249,
650(0)489,
652(0)128,
652(0)368
- Conjunctive,
652(0)140
- form,
607(0)370,
608(0)360,
623(0)138,
626(0)272,
632(0)291,
634(0)271,
642(0)170,
649(0)192
- Limited,
621(0)19,
629(0)355,
649(0)192
- Negation,
591(0)289,
592(0)140,
607(0)400,
619(0)63,
620(0)326,
624(0)297,
624(0)309,
629(0)191,
633(0)339,
633(0)391,
649(0)250
- normal,
607(0)370,
623(0)138,
624(0)309,
626(0)272,
632(0)291,
649(0)265
- number,
570(0)214,
594(0)233,
608(0)286,
613(0)179,
623(0)366,
629(0)227,
650(0)229,
650(0)378,
652(0)164
- polynomial,
591(0)369,
601(0)115,
601(0)122,
601(0)147,
607(0)139,
623(0)53,
623(0)235,
623(0)261,
629(0)494,
634(0)613,
650(0)410,
652(0)191
- when,
635(0)21,
652(0)164