book chapter · Physica-Verlag eBooks · 1993

Solving 3—Satisfiability in less than 1,579 n Steps

Cited by 4Abstract and details only

Abstract

In this paper we present and analyse an improved algorithm for solving the k-Satisfiability problem: Given a family F of r clauses in conjunctive normal form consisting of k literals corresponding to k different variables of a set of n boolean variables. Is F satisfiable?

Cite this paper

APA 7

Schiermeyer, I. (1993). Solving 3—Satisfiability in less than 1,579 n Steps. Physica-Verlag eBooks, 138. https://doi.org/10.1007/978-3-662-12629-5_39

MLA 9

Schiermeyer, Ingo. “Solving 3—Satisfiability in less than 1,579 n Steps.” Physica-Verlag eBooks, 1993, p. 138, https://doi.org/10.1007/978-3-662-12629-5_39.

Chicago

Schiermeyer, Ingo. 1993. “Solving 3—Satisfiability in less than 1,579 n Steps.” Physica-Verlag eBooks: 138. https://doi.org/10.1007/978-3-662-12629-5_39.

Harvard

Schiermeyer, I. (1993) ‘Solving 3—Satisfiability in less than 1,579 n Steps’, Physica-Verlag eBooks, p. 138. Available at: https://doi.org/10.1007/978-3-662-12629-5_39.

BibTeX

@incollection{schiermeyer1993solving,
  title = {{Solving 3—Satisfiability in less than 1,579 n Steps}},
  author = {Schiermeyer, Ingo},
  booktitle = {Physica-Verlag eBooks},
  pages = {138},
  year = {1993},
  doi = {10.1007/978-3-662-12629-5_39}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.