Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
139
click to vote
CSR
2009
Springer
140
views
Theoretical Computer Science
»
more
CSR 2009
»
On the Complexity of Matroid Isomorphism Problems
15 years 10 months ago
Download
itcs.tsinghua.edu.cn
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...
B. V. Raghavendra Rao, Jayalal M. N. Sarma
claim paper
Read More »