Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

COMPLETE SETS AND THE POLYNOMIAL-TIME HIERARCHY.

Author
WRATHALL C
DEP. COMPUT. SCI., YALE UNIV., NEW HAVEN, CONN. 06520, U.S.A.
Source
THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 23-33; BIBL. 13 REF.
Document type
Article
Language
English
Keyword (fr)
AUTOMATE MACHINE TURING TEMPS POLYNOMIAL INFORMATIQUE MATHEMATIQUES APPLIQUEES
Keyword (en)
AUTOMATON TURING MACHINE 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
PASCAL7730320894

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