On the r,s-SAT satisfiability problem and a conjecture of Tovey
type: Item
instance of: scholarly article
title: On the r,s-SAT satisfiability problem and a conjecture of Tovey
zbMATH Open document ID: 0679.68075
DOI: 10.1016/0166-218X(90)90020-D
author: Olivier Dubois
published in: Discrete Applied Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D15
zbMATH DE Number: 4113999
zbMATH Keywords: NP-complete
zbMATH Keywords: satisfiability problem
zbMATH Keywords: conjecture of Tovey
MaRDI profile type: Publication
Wikidata QID: Q123152755
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Q4138187
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: On Representatives of Subsets
cites work: A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: A simplified NP-complete satisfiability problem
full work available at URL: 0166-218x(90)90020-d
OpenAlex ID: W2066022804
description: scientific article; zbMATH DE number 4113999