Sciweavers

1022 search results - page 3 / 205
» Logspace Complexity of Functions and Structures
Sort
View
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
13 years 11 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson
COMPLEXITY
2010
119views more  COMPLEXITY 2010»
13 years 5 months ago
Language networks: Their structure, function, and evolution
Ricard V. Solé, Bernat Corominas-Murtra, Se...
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 10 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
AAAI
2007
13 years 10 months ago
DL-Lite in the Light of First-Order Logic
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large a...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
SEBD
2007
121views Database» more  SEBD 2007»
13 years 9 months ago
Query Answering in Expressive Variants of DL-Lite
The use of ontologies in various application domains, such as Data Integration, the Semantic Web, or ontology-based data management, where ontologies provide the access to large am...
Alessandro Artale, Diego Calvanese, Roman Kontchak...