Skip to search formSkip to main contentSkip to account menu

Matroid oracle

In mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Author(s): Wong, Chiu Wai | Advisor(s): Papadimitriou, Christos H; Raghavendra, Prasad | Abstract: In this thesis we study… 
2016
2016
The famous Dantzig estimator(DE) has been applied in quantum state tomography for estimating an unknown low rank density matrix… 
2016
2016
Path-width of matroids naturally generalizes better known path-width of graphs, and is NP-hard by a reduction from the graph case… 
2013
2013
La theorie de la rigidite etudie l'unicite des realisations des graphes, i.e., des charpentes. Initialement motivee par l… 
2012
2012
This chapter deals with the problem of penalized empirical risk minimizationEmpirical risk minimization (ERM) over a convex set… 
Highly Cited
2005
Highly Cited
2005
Let $M$ be a matroid defined by an independence oracle on ground set $S$, and let $A\subseteq S$. We present an incremental… 
1982
1982
  • K. Truemper
  • 1982
  • Corpus ID: 36828688
1981
1981
When % is a collection of matroids, the question whether M has a minor in % can be easy or hard, depending on the choice of < 6…