Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

A T=O(2N/2), S=O(2N/4) ALGORITHM FOR CERTAIN NP-COMPLETE PROBLEMS

Author
SCHROEPPEL R; ADI SHAMIR
INFORMATION INTERNATIONAL/CULVER CITY CA/USA
Source
SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 456-464; BIBL. 6 REF.
Document type
Article
Language
English
Keyword (fr)
CALCULABILITE COMPLEXITE CALCUL ALGORITHME PROBLEME NP COMPLET PROBLEME SAC A DOS INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
ALGORITHM NP COMPLETE PROBLEM COMPUTER SCIENCES APPLIED MATHEMATICS
Keyword (es)
INFORMATICA MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL82X0036543

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

Searching the Web