7106 search results - page 221 / 1422 » Restricted Complexity, General Complexity |
114
click to vote
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
147
click to vote
COCO
2001
Springer
15 years 8 months ago
2001
Springer
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 ...
127
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
131
click to vote
AUTOMATICA
2005
15 years 4 months ago
2005
The links between identification and control are examined. The main trends in this research area are summarized, with particular focus on the design of low complexity controllers ...
229
click to vote
ISSAC
2011
Springer
14 years 7 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...