“简化流程”
用英语怎么说？

In 1976, Kenneth Appel and Wolfgang Haken finally settled the problem by using early supercomputers to check 1,482 configurations. However, their reliance on machines met a skeptical audience. Many mathematicians doubted whether a computer-assisted calculation could count as a true proof, fearing that hardware glitches might hide critical errors. Decades later, researchers simplified the process to 633 configurations, which the mathematical community accepted immediately. Still, a major limitation remained: the method provided an inefficient recipe for actually coloring maps. For a map with many vertices, checking configurations one after another took considerable time, prompting modern researchers to search for a faster algorithmic approach that could streamline the process.

1976年，肯尼斯·阿佩尔和沃尔夫冈·哈肯通过使用早期超级计算机检查了1482种构型，最终解决了这一难题。然而，他们对机器的依赖遭遇了怀疑的受众。许多数学家怀疑计算机辅助计算是否算得上真正的证明，担心硬件故障可能掩盖关键错误。数十年后，研究人员将该过程简化为633种构型，数学界立即接受了这一结果。尽管如此，一个主要局限依然存在：该方法为实际给地图着色提供了一个低效的配方。对于一个有许多顶点的地图，逐个检查构型耗费了大量时间，促使现代研究人员寻找能够简化流程的更快算法。