Expansion of Symbolic Determinants with Computer
A new type of algorithm is introduced for constructing Expansion of symbolic determinants which encode answers to mathematical problems. Examples include problems from the NP-Complete class, which are widely considered to be harder than those in the problem classes previously addressed. In particular, algorithms are presented that generate expansions of symbolic determinants and the sign (+,-) of each term given their patterns of zero entries. This is wellknown to be exponentially more difficult than evaluating determinants whose entries are merely numerical. Prior approaches to computer computation were impractical for large problems. Our new approach to the production of the solution is based permutation method, recursive programming technology.
Permutation recursive symbolic determinant pruning programming
ZHI Huilai
School of Compute Science and Technology, Henan Polytechnic University, P.R.China, 454000
国际会议
河南焦作
英文
491-496
2011-04-22（万方平台首次上网日期，不代表论文的发表时间）