388 search results - page 56 / 78 » Quantum Lower Bounds by Polynomials |
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
SPIRE
2007
Springer
14 years 4 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
CCECE
2006
IEEE
14 years 4 months ago
2006
IEEE
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
PDCAT
2005
Springer
14 years 3 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...