2412 search results - page 54 / 483 » Which Problems Have Strongly Exponential Complexity |
CF
2007
ACM
14 years 1 months ago
2007
ACM
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
FFA
2010
13 years 8 months ago
2010
Let Fq be a finite field with q elements and p ∈ Fq[X, Y ]. In this paper we study properties of additive functions with respect to number systems which are defined in the rin...
ADBIS
2009
Springer
14 years 4 months ago
2009
Springer
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
PODC
2006
ACM
14 years 3 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...