版权说明 操作指南
首页 > 成果 > 详情

An Algorithmic Feature of a Phase Transition of Random Systems of Linear Equations over Finite Fields

认领
导出
反馈
分享
QQ微信 微博
成果类型:
会议论文
作者:
Shen, Jing*;Fan, Yun
通讯作者:
Shen, Jing
作者机构:
[Shen, Jing] Naval Univ Engn, Sch Sci, Wuhan 430033, Hubei, Peoples R China.
[Fan, Yun] Cent China Normal Univ, Dept Math, Wuhan 430079, Hubei, Peoples R China.
通讯机构:
[Shen, Jing] N
Naval Univ Engn, Sch Sci, Wuhan 430033, Hubei, Peoples R China.
语种:
英文
期刊:
2012 IEEE FIFTH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTATIONAL INTELLIGENCE (ICACI)
年:
2012
页码:
890-892
会议名称:
IEEE 5th International Conference on Advanced Computational Intelligence (ICACI)
会议时间:
OCT 18-20, 2012
会议地点:
Nanjing, PEOPLES R CHINA
会议主办单位:
[Shen, Jing] Naval Univ Engn, Sch Sci, Wuhan 430033, Hubei, Peoples R China.^[Fan, Yun] Cent China Normal Univ, Dept Math, Wuhan 430079, Hubei, Peoples R China.
会议赞助商:
IEEE, IEEE Nanjing Sect
出版地:
345 E 47TH ST, NEW YORK, NY 10017 USA
出版者:
IEEE
ISBN:
978-1-4673-1744-3
基金类别:
NSFCNational Natural Science Foundation of China (NSFC) [11171370]
机构署名:
本校为其他机构
院系归属:
数学与统计学学院
摘要:
This paper exhibits a distinguishing algorithmic feature of a phase transition point of a random system I of m linear equations over a finite field with n variables: the complexity of Gaussian elimination for testing satisfiability of the systems approaches maximum at the satisfiability threshold point m/n = 1, and the worst instances should be found at the point. It is very interesting that the algorithm exactly undergoes an easy/hard...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com