Easy problems are sometimes hard (Q1342226): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4138187 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4012216 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Computing Procedure for Quantification Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Easy problems are sometimes hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4835268 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The hardest constraint problems: A double phase transition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Branch-and-cut solution of inference problems in propositional logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving propositional satisfiability problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Pure Literal Rule and Polynomial Average Time / rank | |||
Normal rank |
Latest revision as of 11:21, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Easy problems are sometimes hard |
scientific article |
Statements
Easy problems are sometimes hard (English)
0 references
11 January 1995
0 references
satisfiability
0 references