Standard

New worst-case upper bounds for SAT. / Hirsch, Edward A.

в: Journal of Automated Reasoning, Том 24, № 4, 01.01.2000, стр. 397-420.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Hirsch, EA 2000, 'New worst-case upper bounds for SAT', Journal of Automated Reasoning, Том. 24, № 4, стр. 397-420. https://doi.org/10.1023/A:1006340920104

APA

Hirsch, E. A. (2000). New worst-case upper bounds for SAT. Journal of Automated Reasoning, 24(4), 397-420. https://doi.org/10.1023/A:1006340920104

Vancouver

Hirsch EA. New worst-case upper bounds for SAT. Journal of Automated Reasoning. 2000 Янв. 1;24(4):397-420. https://doi.org/10.1023/A:1006340920104

Author

Hirsch, Edward A. / New worst-case upper bounds for SAT. в: Journal of Automated Reasoning. 2000 ; Том 24, № 4. стр. 397-420.

BibTeX

@article{6fc98f6566b745d6944b61a681dbc8fc,
title = "New worst-case upper bounds for SAT",
abstract = "Transformation rules constitute a substantial part of the splitting method for handling the SAT problem. This article presents a new transformation rule and two algorithms using such a rule. It is proven that the algorithms have worst-case upper bounds.",
author = "Hirsch, {Edward A.}",
year = "2000",
month = jan,
day = "1",
doi = "10.1023/A:1006340920104",
language = "English",
volume = "24",
pages = "397--420",
journal = "Journal of Automated Reasoning",
issn = "0168-7433",
publisher = "Springer Nature",
number = "4",

}

RIS

TY - JOUR

T1 - New worst-case upper bounds for SAT

AU - Hirsch, Edward A.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - Transformation rules constitute a substantial part of the splitting method for handling the SAT problem. This article presents a new transformation rule and two algorithms using such a rule. It is proven that the algorithms have worst-case upper bounds.

AB - Transformation rules constitute a substantial part of the splitting method for handling the SAT problem. This article presents a new transformation rule and two algorithms using such a rule. It is proven that the algorithms have worst-case upper bounds.

UR - http://www.scopus.com/inward/record.url?scp=0033687739&partnerID=8YFLogxK

U2 - 10.1023/A:1006340920104

DO - 10.1023/A:1006340920104

M3 - Article

AN - SCOPUS:0033687739

VL - 24

SP - 397

EP - 420

JO - Journal of Automated Reasoning

JF - Journal of Automated Reasoning

SN - 0168-7433

IS - 4

ER -

ID: 49829957