On the r,s-SAT satisfiability problem and a conjecture of Tovey (Q1822964): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123152755, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euclidean traveling salesman problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank

Revision as of 10:33, 20 June 2024

scientific article
Language Label Description Also known as
English
On the r,s-SAT satisfiability problem and a conjecture of Tovey
scientific article

    Statements