activity
20142024
most citedRealistic Runtime Analysis for Quantum Simplex Computation

1 citations · 1 across the 4 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2014

A Sharp Upper Bound for the Complexity of Labeled Oriented Trees

Moritz Christmann, Timo de Wolff

A labeled oriented graph (LOG) is an oriented graph with a labeling function from the edge set into the vertex set. The complexity of a LOG is the minimal cardinality of an initial…