13603 search results - page 356 / 2721 » On the Complexity of Computing Treelength |
169
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Existing definitions of the relativizations of NC1 , L and NL do not preserve the inclusions NC1 ⊆ L, NL ⊆ AC1 . We start by giving the first definitions that preserve them....
207
click to vote
SACMAT
2005
ACM
16 years 1 months ago
2005
ACM
As privacy becomes a major concern for both consumers and enterprises, many research efforts have been devoted to the development of privacy protecting technology. We recently pr...
187
click to vote
ICALP
2005
Springer
16 years 1 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
191
click to vote
VAST
2004
ACM
2004
ACM
A Point-Based Approach for Capture, Display and Illustration of Very Complex Archeological Artefacts
16 years 29 days ago
In this paper we present a complete point-based pipeline for the capture, display and illustration of very large scans of archeological artifacts. This approach was developed as p...
181
click to vote
SAT
2004
Springer
16 years 27 days ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...