849 search results - page 10 / 170 » On the Complexity of the Whitehead Minimization Problem |
DLOG
2011
12 years 11 months ago
2011
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also for DLs, where research focused on the...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
ESORICS
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
PODS
2003
ACM
14 years 7 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
ICCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the Coupled Cluster method. Transformations using algeb...