Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Experimental comparison of the two Fredman-Khachiyan-algorithms

From MaRDI portal
Publication:5233575
Jump to:navigation, search

DOI10.1137/1.9781611972894.15zbMath1430.68472OpenAlexW4477946MaRDI QIDQ5233575

Peter Horatschek, Matthias Hagen, Martin Mundhenk

Publication date: 11 September 2019

Published in: 2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972894.15



Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05)


Related Items (3)

The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ Unnamed Item ⋮ On Quantifying Literals in Boolean Logic and its Applications to Explainable AI




This page was built for publication: Experimental comparison of the two Fredman-Khachiyan-algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5233575&oldid=19846357"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 19:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki