Under the auspices of the
Computational Complexity Foundation (CCF)
2024
2023
2022
2024...1994
REPORTS > KEYWORD > AUGMENTING PATH:
Reports tagged with augmenting path:
TR00-049 | 2nd May 2000
Herbert Fleischner, Stefan Szeider
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
more >>>
ISSN 1433-8092 |
Imprint
