Fundamentals of Computation Theory
Springer
Chapter title |
The Complexity of Maximum Matroid-Greedoid Intersection
|
---|---|
Chapter number | 60 |
Book title |
Fundamentals of Computation Theory
|
Published by |
Springer, Berlin, Heidelberg, August 2001
|
DOI | 10.1007/3-540-44669-9_60 |
Book ISBNs |
978-3-54-042487-1, 978-3-54-044669-9
|
Authors |
Taneli Mielikäinen, Esko Ukkonen |
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 1 | 50% |
Student > Postgraduate | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 50% |
Computer Science | 1 | 50% |