123 search results - page 12 / 25 » Complexity of Boolean Functions on PRAMs - Lower Bound Techn... |
FCT
2003
Springer
14 years 18 days ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
AAAI
2007
13 years 9 months ago
2007
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...
SEBD
2007
13 years 8 months ago
2007
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...
ICML
2001
IEEE
14 years 8 months ago
2001
IEEE
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...