A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128277421, #quickstatements; #temporary_batch_1730404204939
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-019-00554-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2919232531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Algorithms for Weighted Matching in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric dispatching of hard real-time tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding read-once resolution refutations in systems of 2CNF clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of read-once resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The octagon abstract domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal length resolution refutations of difference constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for optimal length resolution refutation in difference constraint systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial certifying algorithm for linear feasibility in UTVPI constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128277421 / rank
 
Normal rank

Latest revision as of 20:50, 31 October 2024

scientific article
Language Label Description Also known as
English
A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
scientific article

    Statements

    A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (English)
    0 references
    0 references
    21 May 2019
    0 references
    read-once refutation
    0 references
    UTVPI constraints
    0 references
    difference constraints
    0 references
    literal-once refutation
    0 references
    NP-hard
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references