Sciweavers

1225 search results - page 44 / 245
» The Instance Complexity Conjecture
Sort
View
BMCBI
2010
102views more  BMCBI 2010»
13 years 9 months ago
SAMPLEX: Automatic mapping of perturbed and unperturbed regions of proteins and complexes
Background: The activity of proteins within the cell is characterized by their motions, flexibility, interactions or even the particularly intriguing case of partially unfolded st...
Mickaël Krzeminski, Karine Loth, Rolf Boelens...
DCC
2008
IEEE
14 years 8 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev
STACS
2009
Springer
14 years 3 months ago
Tractable Structures for Constraint Satisfaction with Truth Tables
The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation...
Dániel Marx
JAT
2010
39views more  JAT 2010»
13 years 7 months ago
On spectral polynomials of the Heun equation. I
The classical Heun equation has the form  Q(z) d2 dz2 + P (z) d dz + V (z) ff S(z) = 0, where Q(z) is a cubic complex polynomial, P (z) is a polynomial of degree at most 2 and ...
Boris Shapiro, Milos Tater
ANLP
2000
91views more  ANLP 2000»
13 years 10 months ago
Finite-State Reduplication in One-Level Prosodic Morphology
Reduplication, a central instance of prosodic morphology, is particularly challenging for state-ofthe-art computational morphology, since it involves copying of some part of a pho...
Markus Walther