The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
The satisfiability problem of conjunction normal form (abbreviate sat problem) is an NP_complete problem.
合取范式可满足性问题(简称SAT问题)是一个NP完全问题。
They sat down to consider the problem.
他们坐下来考虑这一问题。
I sat down beside him, trying to think out the problem.
我在他身旁坐下，准备好好考虑一下那个问题。
He sat quietly, turning over the problem.
他静静地坐在那里，思考着那个问题。
But we just sat on the runway due to a problem in the control tower.
但其实我们也就是呆在跑道上，因为控制塔台出问题了。
I sat quietly, turning over the problem.
我悄然默默地坐在那里，思索着这个问题。
Satisfiability (SAT) problem has been the core problem of research on computational theory.
可满足性问题(SAT)是当代理论计算机科学的核心问题。
Andy sat down at the table and inquired as to what the problem was.
安迪在桌边落座，询问出了什么问题。
I sat mulling over my problem without finding a solution.
我坐着一遍又一遍地思考我的问题，可总是找不到解决办法。
I sat down beside him trying to think out the problem.
我在他身旁坐下准备好好考虑一下这个问题。
I sat down beside him trying to think out the problem.
我在他身旁坐下准备好好考虑一下这个问题。
应用推荐