Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Near-testable sets

Author
GOLDSMITH, J; HEMACHANDRA, L. A; JOSEPHI, D; YOUNG, P
Boston univ., dep. computer sci., Boston MA 02215, United States
Source

SIAM journal on computing (Print). 1991, Vol 20, Num 3, pp 506-523 ; ref : 36 ref

ISSN
0097-5397
Scientific domain
Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Classe complexité Complexité calcul Informatique théorique Relation ordre Fonction unilatère Structure ordonnée
Keyword (en)
Complexity class Computing complexity Computer theory Ordering
Keyword (es)
Clase complejidad Complejidad cálculo Informática teórica Relación orden
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
5070618

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