一个问题:关于SAT - CS版

本页内容为未名空间相应帖子的节选和存档，一周内的贴子最多显示50字，超过一周显示500字访问原贴

CS版 - 一个问题:关于SAT

相关主题
● arXiv又放出神作：NP=P (by 国防科大)	● How to stay focused in research?
● 给力: a claimed proof for P==NP	● Heuristic for 8 puzzle
● CS害了CS	● 关于feature selection
● which areas of multi-agent are hot?	● shortest path algorithm(dijkstra)的变形
● 请教minimum set cover Problem	● 求paper
● A problem of QoS flow set-up	● 关于algorithm package的 caption 编号方式
● 请教一个概率问题 (转载)	● 向学cs的同学请教一个问题
● 请教一个聚类的问题	● 如何模拟multimodal的时间序列数据？

相关话题的讨论汇总
话题: literals话题: sat话题: negative话题: problem话题: number

进入CS版参与讨论

(共1页)

k*****e
发帖数: 152

In SAT problem, when the number of negative literals is much less than the num
ber of all literals, does the problem become polynomial. Is there any SAT alg
. (not heuristic) exponential to the number of negative literals? Thanks!

(共1页)

进入CS版参与讨论

相关主题
● 如何模拟multimodal的时间序列数据？	● 请教minimum set cover Problem
● 我不行了，大虾帮忙	● A problem of QoS flow set-up
● mind execise	● 请教一个概率问题 (转载)
● 谁给一点思路，关于找最小值的问题	● 请教一个聚类的问题
● arXiv又放出神作：NP=P (by 国防科大)	● How to stay focused in research?
● 给力: a claimed proof for P==NP	● Heuristic for 8 puzzle
● CS害了CS	● 关于feature selection
● which areas of multi-agent are hot?	● shortest path algorithm(dijkstra)的变形

相关话题的讨论汇总
话题: literals话题: sat话题: negative话题: problem话题: number

#	版面	帖数(主题数)
-	全站	4871 (796)
1	Military	3777 (569)
2	Stock	341 (51)
3	Joke	117 (17)
4	History	116 (3)
5	Automobile	100 (9)
6	USANews	55 (9)
7	Midlife	45 (1)
8	Headline	41 (41)
9	Dreamer	33 (13)
10	FleaMarket	32 (20)
11	Living	30 (7)

boards

未名新帖统计// 7月16日

历史上的今天