Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

CONTEXT-FREE GRAMMARS AS A TOOL FOR DESCRIBING POLYNOMIAL-TIMES SUBCLASSES OF HARD PROBLEMS

Author
SLISENKO AO
LOMI/LENINGRAD 191011/SUN
Source
INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 2; PP. 52-56; BIBL. 3 REF.
Document type
Article
Language
English
Keyword (fr)
GRAMMAIRE FORMELLE GRAMMAIRE GRAPHE THEORIE LANGAGE COMPLEXITE CALCUL GRAMMAIRE CF CIRCUIT HAMILTONIEN PROBLEME DUR TEMPS POLYNOMIAL INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
INFORMATION SYSTEM INFORMATION RETRIEVAL 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
PASCAL82X0196963

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