Sciweavers

451 search results - page 4 / 91
» On Parameterized Exponential Time Complexity
Sort
View
CIE
2008
Springer
13 years 10 months ago
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen
RECOMB
2006
Springer
14 years 8 months ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
14 years 1 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
MFCS
2004
Springer
14 years 1 months ago
Polynomial Time Approximation Schemes and Parameterized Complexity
Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia