Backdoor sets for DLL subsolvers (Q862400): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027605646 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4375756 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A machine program for theorem-proving / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Computing Procedure for Quantification Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3396009 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Analysis of cyclic combinational circuits / rank | |||
Normal rank | |||
Latest revision as of 12:53, 25 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Backdoor sets for DLL subsolvers |
scientific article |
Statements
Backdoor sets for DLL subsolvers (English)
0 references
24 January 2007
0 references
propositional satisfiability problem
0 references
0 references
