On the r,s-SAT satisfiability problem and a conjecture of Tovey
- 1 January 1990
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 26 (1) , 51-60
- https://doi.org/10.1016/0166-218x(90)90020-d
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalitiesMathematical Programming, 1986
- A simplified NP-complete satisfiability problemDiscrete Applied Mathematics, 1984
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935