On the Complexity of Some Enumeration Problems for Matroids

Khachiyan, Leonid; Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa

Local TagsRelease HistoryDetailsSummary

On the Complexity of Some Enumeration Problems for Matroids

Khachiyan, L., Boros, E., Elbassioni, K., Gurvich, V., & Makino, K. (2005). On the Complexity of Some Enumeration Problems for Matroids. SIAM Journal on Discrete Mathematics, 19, 966-984.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2732-4 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2733-2

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Khachiyan, Leonid, Author
Boros, Endre, Author
Elbassioni, Khaled¹, Author
Gurvich, Vladimir, Author
Makino, Kazuhisa, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2006-04-20Date issued: 2005

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 279149
Other: Local-ID: C1256428004B93B8-B84F3482262FD67BC125714700050317-Elbassioni2005jb

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: SIAM Journal on Discrete Mathematics

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: -

Pages: - Volume / Issue: 19 Sequence Number: - Start / End Page: 966 - 984 Identifier: -