Extension and equivalence problems for clause minimal formulae (Q1777408): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal Representation of Directed Hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4488342 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5309031 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of facets resolved / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounded Query Classes / rank | |||
Normal rank |
Revision as of 10:29, 10 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Extension and equivalence problems for clause minimal formulae |
scientific article |
Statements
Extension and equivalence problems for clause minimal formulae (English)
0 references
13 May 2005
0 references
minimal unsatisfiable formulae
0 references
0 references