We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
We present a new approachto interactive modeling of freeform surfaces. Instead of a fixed mesh of control points, the model presented to the user is that of an infinitely malleabl...
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...