Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60060025, #quickstatements; #temporary_batch_1705750702424
Created claim: DBLP publication ID (P1635): journals/tcs/FleischnerKS02, #quickstatements; #temporary_batch_1731505720702
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / 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: A perspective on certain polynomial-time solvable classes of satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigations on autark assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem-Proving for Computers: Some Results on Resolution and Renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two tractable subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/FleischnerKS02 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:07, 13 November 2024

scientific article
Language Label Description Also known as
English
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
scientific article

    Statements

    Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (English)
    0 references
    0 references
    0 references
    0 references
    21 January 2003
    0 references
    Minimal unsatisfiable
    0 references
    SAT
    0 references
    Deficiency
    0 references
    Matching
    0 references
    Autarky
    0 references
    Polynomial time algorithm
    0 references

    Identifiers