Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

A T-S2=O(2N) TIME/SPACE TRADEOFF FOR CERTAIN NP-COMPLETE PROBLEMS

Author
SCHROEPPEL R; ADI SHAMIR
INFORMATION INTERNATIONAL/CULVER CITY CA/USA
Source
ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SICENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 328-336; BIBL. 7 REF.
Document type
Conference Paper
Language
English
Keyword (fr)
PROBLEME NP COMPLET RESOLUTION PROBLEME COMPLEXITE ALGORITHME ALGORITHMIQUE INTELLIGENCE ARTIFICIELLE INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
NP COMPLETE PROBLEM PROBLEM SOLVING ALGORITHM COMPLEXITY ALGORITHMICS ARTIFICIAL INTELLIGENCE 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
PASCAL8130085939

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