Pages that link to "Item:Q1941901"

The following pages link to Improved algorithms for optimal length resolution refutation in difference constraint systems (Q1941901):

Displaying 8 items.

• On approximating optimal weight ``no''-certificates in weighted difference constraint systems (Q721917) (← links)
• Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
• On the negative cost girth problem in planar networks (Q891820) (← links)
• Empirical analysis of algorithms for the shortest negative cost cycle problem (Q1634773) (← links)
• Randomized algorithms for finding the shortest negative cost cycle in networks (Q1693163) (← links)
• Analyzing unit read-once refutations in difference constraint systems (Q2055789) (← links)
• A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints (Q2415363) (← links)
• Unit read-once refutations for systems of difference constraints (Q6174656) (← links)