An exponential lower bound for the pure literal rule

Khaled M. Bugrara, Paul W. Purdom

Open source

DOI
10.1016/0020-0190(88)90028-2
Published
1988-04
Container
Information Processing Letters
Publisher
Elsevier BV
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/0020-0190-88-90028-2,
  title = {An exponential lower bound for the pure literal rule},
  author = {Khaled M. Bugrara and Paul W. Purdom},
  year = {1988},
  journal = {Information Processing Letters},
  doi = {10.1016/0020-0190(88)90028-2},
  url = {https://doi.org/10.1016/0020-0190(88)90028-2}
}

RIS

TY  - JOUR
TI  - An exponential lower bound for the pure literal rule
AU  - Khaled M. Bugrara
AU  - Paul W. Purdom
PY  - 1988
JO  - Information Processing Letters
DO  - 10.1016/0020-0190(88)90028-2
UR  - https://doi.org/10.1016/0020-0190(88)90028-2
ER  - 

APA

Bugrara, K. M., & Purdom, P. W. (1988). An exponential lower bound for the pure literal rule. Information Processing Letters. https://doi.org/10.1016/0020-0190(88)90028-2

Source records