.png){kind=icon}
返回
When Satisfiability Solving Meets Symbolic Computation
.png){kind=icon}
PRE
AI
DOI：10.1145/3500921.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
MATHEMATICIANS HAVE LONG been fascinated by objects that exhibit exceptionally nice combinatorial properties. However, it is often difficult to determine whether objects satisfying a given combinatorial property exist. Sometimes, the only feasible method of definitively answering the question of existence is simply to perform a systematic search. A famous example of this is the proof of the four-color theorem-the notion that four colors suffice to color the regions of a planar map with adjacent regions colored differently.3 The theorem has been known to be true since 1977, but every known proof relies on computer calculations in an essential way. Mathematical arguments are used to reduce the search for counterexamples to a finite number of cases, and the cases are then
Keyword:
PROJECTIVE PLANE
SAT
SEQUENCES
SEARCH
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
Kinetics of the isomerization of 1-chloro- and 2-chloropentaborane(9) using diethyl ether catalyst
PREAI
分享收藏Enhanced photocatalytic activity of FeSO4 in a ZnO photocatalyst with H2O2 for dye degradation.png)
Optik
OptikIF0
PREAI
分享收藏Adsorption kinetic studies of activated carbon fabric for the removal of volatile organic components
PREAI
分享收藏Improvement of roasting and metallurgical properties of fluorine-bearing iron concentrate pellets
PREAI
分享收藏Mapping landscape connectivity as a driver of species richness under tectonic and climatic forcing
OAAI
OAAI分享收藏
查看更多内容