The complexity of satisfiability problems

1978 · 1,771 citations · 0 from inside this corpus

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

1 of 1 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

Paper	Year	Cited
A Computing Procedure for Quantification Theory	1960	2,623

Links

DOI · Open access copy · OpenAlex record

Topics

Logic, Reasoning, and Knowledge	Computer Science
Formal Methods in Verification	Computer Science
Logic, programming, and type systems	Computer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports1 author record(s) attached.
supports14 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:53+00:00.

sha256 db1645b78a57e29a…