Pascal and Francis Bibliographic Databases

Help

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

Export

Selection :

Relativized worlds with an infinite hierarchy

Author
FORTNOW, L1
[1] University of Chicago, Department of Computer Science, 1100 E. 58th. St., Chicago, IL 60637, United States
Source

Information processing letters. 1999, Vol 69, Num 6, pp 309-313 ; ref : 22 ref

CODEN
IFPLAT
ISSN
0020-0190
Scientific domain
Computer science
Publisher
Elsevier Science, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Complexité algorithme Complexité calcul Machine Turing Temps polynomial
Keyword (en)
Algorithm complexity Computational complexity Turing machine Polynomial time
Keyword (es)
Complejidad algoritmo Complejidad computación Máquina Turing Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
1773767

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

Access to the document

Searching the Web