2 papers
cs.LO2003
Learning in a Compiler for MINSAT Algorithms
Anja Remshagen, Klaus Truemper
This paper describes learning in a compiler for algorithms solving classes of the logic minimization problem MINSAT, where the underlying propositional formula is in conjunctive no…
math.CO2003
On the graph-density of random 0/1-polytopes
Volker Kaibel, Anja Remshagen
Let X_{d,n} be an n-element subset of {0,1}^d chosen uniformly at random, and denote by P_{d,n} := conv X_{d,n} its convex hull. Let D_{d,n} be the density of the graph of P_{d,n}…