Treffer: On checking versus evaluation of multiple queries
Title:
On checking versus evaluation of multiple queries
Authors:
Source:
Information and computation (Print). 105(1):72-93
Publisher Information:
San Diego, CA: Elsevier, 1993.
Publication Year:
1993
Physical Description:
print, 2 p.1/4
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Combinatoire, Combinatorics, Combinatoria, Complexité calcul, Computing complexity, Complejidad cálculo, Vecteur caractéristique, Characteristic vector
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Maryland, dep. computer sci., inst. advanced computer studies, College Park MD 20742, United States
ISSN:
0890-5401
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
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
CC BY 4.0
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
Notes:
Operational research. Management
Accession Number:
edscal.4902421
Database:
PASCAL Archive
Weitere Informationen
The plausibility of computing to answers to many membership queries to a hard set with few queries is the subject of the theory of tersenss. In this paper, we develop companion theories―both complexity―theoretic and recursion-theoretic-of characteristic vector terseness. These theories ask whether the answers to many membership queries to a hard set can be checked with fewer queries.