Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,355,000 papers from all fields of science
Search
Sign In
Create Free Account
Matroid oracle
In mathematics and computer science, a matroid oracle is a subroutine through which an algorithm may access a matroid, an abstract combinatorial…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Algorithm
Bicircular matroid
Binary matroid
Black box group
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Optimization Everywhere: Convex, Combinatorial, and Economic
C. W. Wong
2018
Corpus ID: 197490076
Author(s): Wong, Chiu Wai | Advisor(s): Papadimitriou, Christos H; Raghavendra, Prasad | Abstract: In this thesis we study…
Expand
2016
2016
The optimality of Dantzig estimator for estimating low rank density matrices ∗
Dong Xia
2016
Corpus ID: 15876275
The famous Dantzig estimator(DE) has been applied in quantum state tomography for estimating an unknown low rank density matrix…
Expand
2016
2016
Simpler Self-reduction Algorithm for Matroid Path-width
Petr Hlinený
arXiv.org
2016
Corpus ID: 2276008
Path-width of matroids naturally generalizes better known path-width of graphs, and is NP-hard by a reduction from the graph case…
Expand
2013
2013
Constructive approaches to the rigidity of frameworks
V. Nguyen
2013
Corpus ID: 29146014
La theorie de la rigidite etudie l'unicite des realisations des graphes, i.e., des charpentes. Initialement motivee par l…
Expand
2012
2012
Sharp Oracle Inequalities in Low Rank Estimation
V. Koltchinskii
Empirical Inference
2012
Corpus ID: 13684931
This chapter deals with the problem of penalized empirical risk minimizationEmpirical risk minimization (ERM) over a convex set…
Expand
2006
2006
On the incompatibility of faithfulness and monotone DAG faithfulness
D. M. Chickering
,
Christopher Meek
Artificial Intelligence
2006
Corpus ID: 2050211
Highly Cited
2005
Highly Cited
2005
On the Complexity of Some Enumeration Problems for Matroids
L. Khachiyan
,
E. Boros
,
Khaled M. Elbassioni
,
V. Gurvich
,
K. Makino
SIAM Journal on Discrete Mathematics
2005
Corpus ID: 867255
Let $M$ be a matroid defined by an independence oracle on ground set $S$, and let $A\subseteq S$. We present an incremental…
Expand
1996
1996
Ordered matroids and regular independence systems
J. Cerdeira
,
P. Bárcia
Discrete Mathematics
1996
Corpus ID: 42017904
1982
1982
On the Efficiency of Representability Tests for Matroids
K. Truemper
European journal of combinatorics (Print)
1982
Corpus ID: 36828688
1981
1981
Detecting Matroid Minors
P. Seymour
,
P. Walton
1981
Corpus ID: 16275552
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required