Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4113910

On the problem of approximating the number of bases of a matroid

Author
AZAR, Y1 ; BRODER, A. Z; FRIEZE, A. M
[1] Tel-Aviv univ., dep. computer sci., Tel-Aviv, Israel
Source

Information processing letters. 1994, Vol 50, Num 1, pp 9-11 ; ref : 12 ref

CODEN
IFPLAT
ISSN
0020-0190
Scientific domain
Computer science
Publisher
Elsevier Science, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Algorithmique Approximation Base Calcul Complexité Comptage Matroïde Problème ¬=P-difficile
Keyword (en)
Algorithmics Approximation Base Calculation Complexity Counting Matroid
Keyword (es)
Algorítmica Aproximacion Base Cálculo Complejidad Contaje Matroide
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
4113910

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web