删除或更新信息，请邮件至freekaoyan#163.com(#换成@)

孙瑶:Towards the Least Inequalities for Describing a Subset in Z_2^n

本站小编 Free考研考试/2021-12-26


Academy of Mathematics and Systems Science, CAS
Colloquia & Seminars
Speaker: 孙瑶，中国科学院信息工程研究所
Inviter:
Title:
 Towards the Least Inequalities for Describing a Subset in Z_2^n
Time & Venue:
 2021.11.03 19:00-20:00 腾讯会议: 907 682 157
Abstract:
 Mixed Integer Linear Programming (MILP) solvers have become one of the most powerful tools for searching cryptographic characteristics. Generally, the models with fewer constraints and variables are usually easier to solve. In this paper, we discuss this problem in a general form. Specifically, given a set C \subset Z_2^n, let L be a set of inequalities, and we say L describes C if the inequalities in L only involve n variables and the solution set to L is exactly C. Our goal is to find such a set L with the least number of inequalities. We present a brand new approach for resolving this problem completely. Our approach is able to generate all available non-equivalent inequalities. Once these inequalities are obtained, Sasaki and Todo's method is used to find out the smallest subset of inequalities that describes C. When Sasaki and Todo's method succeeds, the found subset will be proved as the smallest.

相关话题/信息 中国科学院 腾讯 工程研究所 会议

Free考研考试FreeKaoYan.Com
欢迎来到Free考研考试，"为实现人生的Free而奋斗"

© 2020 FreeKaoYan! . All rights reserved.