检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Mathematics Mechanization Key Lab,AMSS,Chinese Academy of Sciences,Beijing 100080,China
出 处:《Science China Mathematics》2008年第12期2137-2148,共12页中国科学:数学(英文版)
基 金:supported by the National Key Basic Research Project of China (Grant No. 2004CB318001)
摘 要:This paper investigates complex brackets and balanced complex 1st-order difference (BCD) polynomials. Then we propose an algorithm of O(n log n) complexity to check the equality of brackets. It substitutes exponential algorithms before. Also, BCD polynomials have some usages in geometric calculation.This paper investigates complex brackets and balanced complex 1st-order di?erence (BCD) polynomials. Then we propose an algorithm of O(n log n) complexity to check the equality of brackets. It substitutes exponential algorithms before. Also, BCD polynomials have some usages in geometric calculation.
关 键 词:conformal geometric algebra (CGA) null bracket algebra (NBA) geometric invariant mechanical proving normal forms 68T15 03B35
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.142.92.19