课题基金 / 基金详情

COMBINATORIC OF MINIMALLY UNSATISFIABLE CLAUSE-SETS

最小不可满足子句集的组合

批准号：

1773023

负责人：

金额：

$0.0万

依托单位：

Swansea University

依托单位国家：

英国

项目类别：

Studentship

财政年份：

2015

资助国家：

英国

项目状态：

已结题

起止时间：

2015 至 --

来源：

https://gtr.ukri.org/projects?ref=studentship-1773023

关键词：

COMBINATORIC MINIMALLY UNSATISFIABLE CLAUSE SETS

项目摘要

项目成果

相似基金

相关文献

中文摘要

翻译

点击翻译按钮获取中文摘要

英文摘要

The basics of the anticipated PhD topic, the study of minimally unsatisfiable formulas (MUs) of low complexity,have been established. A first result, to be submitted to SAT 2017 (the main conference of the field) in March,is a new proof of the MU(2)-characterisation.Also a first journal submission should come out of this, which will include more material on MU(1).So I am happy with the progress, and I am confident that the PhD will be successfully completed.

期刊论文(1)

专著(0)

科研奖励(0)

会议论文