A POLYNOMIAL-TIME ALGORITHM FOR SUBPATTERN MATCHING

被引：2

|

作者：

NYO, HL

SUK, M

机构：

来源：

PROCEEDINGS OF THE IEEE | 1986年 / 74卷 / 02期

关键词：

D O I：

10.1109/PROC.1986.13471

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

收藏

页码：375 / 377

页数：3

相关论文

共 50 条

[41] An entire space polynomial-time algorithm for linear programming
Da Gang Tian
Journal of Global Optimization, 2014, 58 : 109 - 135
[42] POLYNOMIAL-TIME ALGORITHM FOR KNAPSACK PROBLEM WITH 2 VARIABLES
HIRSCHBERG, DS
WONG, CK
JOURNAL OF THE ACM, 1976, 23 (01) : 147 - 154
[43] A polynomial-time algorithm for the change-making problem
Pearson, D
OPERATIONS RESEARCH LETTERS, 2005, 33 (03) : 231 - 234
[44] Polynomial-time algorithm for fixed points of nontrivial morphisms
Holub, Stepan
DISCRETE MATHEMATICS, 2009, 309 (16) : 5069 - 5076
[45] A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE YOLK IN FIXED DIMENSION
TOVEY, CA
MATHEMATICAL PROGRAMMING, 1992, 57 (02) : 259 - 277
[46] A polynomial-time algorithm for a class of protein threading problems
Xu, Y
Uberbacher, EC
COMPUTER APPLICATIONS IN THE BIOSCIENCES, 1996, 12 (06): : 511 - 517
[47] A polynomial-time algorithm to find Shortest Paths with Recourse
Provan, JS
NETWORKS, 2003, 41 (02) : 115 - 125
[48] A POLYNOMIAL-TIME ALGORITHM FOR FRACTIONAL PROGRAMS WITH CONVEX CONSTRAINTS
FREUND, RW
JARRE, F
ZEITSCHRIFT FUR ANGEWANDTE MATHEMATIK UND MECHANIK, 1994, 74 (06): : T523 - T525
[49] A polynomial-time algorithm for computing absolutely normal numbers
Becher, Veronica
Ariel Heiber, Pablo
Slaman, Theodore A.
INFORMATION AND COMPUTATION, 2013, 232 : 1 - 9
[50] A polynomial-time algorithm for knapsack with divisible item sizes
Verhaegh, WFJ
Aarts, EHL
INFORMATION PROCESSING LETTERS, 1997, 62 (04) : 217 - 221

← 1 2 3 4 5 →