Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

COMPLEXITY THEORY WITH EMPHASIS ON THE COMPLEXITY OF LOGICAL THEORIES

Author
LADNER RE
UNIV. WASHINGTON, DEP. COMPUTER SCI./SEATTLE WA 98195/USA
Source
LONDON MATH. SOC. LECTURE NOTE SER.; GBR; DA. 1980; NO 45; PP. 286-319; BIBL. 4 P.
Document type
Conference Paper
Language
English
Keyword (fr)
COMPLEXITE CALCUL RESOLUTION PROBLEME ORDINATEUR PROGRAMME ORDINATEUR MACHINE TURING AUTOMATE CALCULABILITE THEORIE AUTOMATE INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
COMPUTING COMPLEXITY PROBLEM SOLVING COMPUTERS COMPUTER PROGRAMS TURING MACHINE AUTOMATON CALCULABILITY AUTOMATA THEORY 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
PASCAL8130146026

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