On the complexity of some enumeration problems for matroids

Journal article

Peer reviewed

L Khachiyan, E Boros, K Elbassioni, V Gurvich and K Makino

SIAM journal on discrete mathematics, Vol.19(4), pp.966-984

2006

Abstract

Algorithmics. Computability. Computer arithmetics

Applied sciences

Classical combinatorial problems

Combinatorics

Combinatorics. Ordered structures

Computer science; control theory; systems

Designs and configurations

Exact sciences and technology

Graph theory

Mathematics

Sciences and techniques of general use

Theoretical computing

11 Record Views

Title: On the complexity of some enumeration problems for matroids
Creators: L Khachiyan - Department of Computer Sciences, Rutgers University, 110 Frelinghuysen Road, Piscataway, NJ 08854-8003, United States
E Boros - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003, United States
K Elbassioni - Max-Planck-Institut für Informatik, Saarbrucken, Germany
V Gurvich - RUTCOR, Rutgers University, 640 Bartholomew Road, Piscataway, NJ 08854-8003, United States
K Makino - Department of Computer Sciences, Rutgers University, 110 Frelinghuysen Road, Piscataway, NJ 08854-8003, United States
Publication Details: SIAM journal on discrete mathematics, Vol.19(4), pp.966-984
Date published: 2006
Publisher: Society for Industrial and Applied Mathematics
Academic Unit: Management Science and Information Systems (RBS)
Language: English
Resource Type: Journal article
Identifiers: 991031666032304646