Algorithms and Computation

DOI10.1007/b94771zbMath1205.05038OpenAlexW1769833081MaRDI QIDQ5191676

Endre Boros, Vladimir A. Gurvich, Khaled M. Elbassioni, Leonid G. Khachiyan

Publication date: 7 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94771

zbMATH Keywords

matroidcircuitspanning setflatinfeasible system of linear equationsminimal infeasible subsystem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory ⋮ Scientific contributions of Leo Khachiyan (a short overview) ⋮ Precision and Sensitivity in Detailed-Balance Reaction Networks

This page was built for publication: Algorithms and Computation