搜索结果: 1-3 共查到“代数学 Matroid”相关记录3条 . 查询时间(0.045 秒)
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 polynomially growing fie...
On the Complexity of Matroid Isomorphism Problems
On the Complexity of Matroid Isomorphism Problems
2012/12/3
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 polynomially growing fiel...
Characterizations of Matroid VIA OFR-Sets
Feeble-matroid Strong map Hesitant map ORF-set OFF-set OFR-set
2010/3/1
The aim of this paper is to introduce the class of OFR-sets as the sets that are the intersection of an open set and a feeble-regular set. Several classes of matroids are studied via the new concept. ...