User rus9384

1

vote

1

answer

2k

views

3-SAT with 3 variable occurences

3-sat

Sep 5 '17 at 18:27 David Richerby 77.9k

1

vote

2

answers

1k

views

Why AKS primality test is called polynomial?

complexity-theory

May 18 '17 at 15:18 D.W.♦ 124k

1

2

votes

1

answer

1k

views

$NP \ vs \ co-NP$: tautology to SAT and vice versa?

complexity-theory np-complete satisfiability np

Jun 8 '17 at 5:45 Kyle Jones 6,915

1

vote

1

answer

477

views

SAT to knapsack vs. ETH

np-complete satisfiability knapsack-problems

Aug 18 '17 at 15:51 Ariel 11.6k

2

votes

1

answer

300

views

Reduction from 2-SAT to 2-XOR-SAT?

complexity-theory satisfiability

Jul 6 '17 at 20:00 rus9384 1,267

1

3

votes

1

answer

294

views

Satisfiabililty sufficient condition?

satisfiability

Aug 21 '17 at 7:57 rus9384 1,267

0

votes

1

answer

253

views

Are poly-reductions to PSPACE problems for following problems are known?

algorithms complexity-theory time-complexity decision-problem

May 11 '17 at 20:11 Ariel 11.6k

1

3

votes

2

answers

245

views

Is it possible to prove $\mathsf{BPP = NP}$ statistically?

complexity-theory np

Jun 8 '17 at 23:04 Ariel 11.6k

1

3

votes

1

answer

225

views

Linear time multiplication on RAM machine?

algorithms asymptotics integers multiplication

Sep 13 '17 at 4:24 ryan 4,136

1

4

votes

2

answers

208

views

Why Djikstra's algorithm is said to have $\mathcal{O}(|V|^2)$ complexity?

complexity-theory graphs time-complexity runtime-analysis

May 27 '17 at 23:07 Community♦ 1

1

vote

1

answer

180

views

Is generating MIN-3-UNSAT $\mathsf{NP}$-hard?

np-hard satisfiability boolean-algebra 3-sat

Aug 11 '17 at 17:10 rus9384 1,267

2

votes

1

answer

163

views

Is this case of weighted 2SAT NP-complete?

np-complete 2-sat

Aug 21 '17 at 8:04 Yuval Filmus 232k

0

votes

1

answer

156

views

Colored cliques complexity

complexity-theory graphs clique

May 26 '17 at 15:08 rus9384 1,267

2

votes

1

answer

131

views

Is boolean formula isomorphism NP-complete?

np-complete boolean-algebra

Aug 22 '18 at 8:11 Thinh D. Nguyen 2,197

1

2

votes

1

answer

127

views

Was it known that $\mathsf{LTIME \subsetneq NLTIME}$?

complexity-theory time-complexity

Jun 27 '17 at 21:23 D.W.♦ 124k

0

votes

1

answer

121

views

Another way to solve SAT. Was it known?

satisfiability sat-solvers

Sep 7 '17 at 14:43 rus9384 1,267

1

vote

0

answers

115

views

Correct implication for 3SAT from this theorem?

complexity-theory np-complete satisfiability

Aug 13 '17 at 15:04 rus9384 1,267

2

votes

1

answer

105

views

Number of minimal unsatisfiable partial assignments in 2-SAT/3-SAT

satisfiability counting

Aug 13 '17 at 5:09 D.W.♦ 124k

1

4

votes

0

answers

100

views

Can minimal CNF contain clause longer than initial CNF?

boolean-algebra normal-forms

Mar 18 at 11:05 xxx 1

3

votes

1

answer

95

views

Solving 2-CNF TQBF with #SAT solver?

algorithms reductions

Jun 2 '17 at 9:46 Yuval Filmus 232k

1

vote

1

answer

92

views

How can I understand if reduction is Karp reduction?

reductions

Jun 29 '17 at 14:58 Yuval Filmus 232k

0

votes

0

answers

85

views

Is this problem $\mathsf{NEXP}$-complete?

complexity-theory

Sep 16 '17 at 2:28 rus9384 1,267

1

2

votes

2

answers

84

views

Do we know something about this refutation method for SAT?

np-complete satisfiability

Jan 28 at 18:06 Kyle Jones 6,915

1

vote

0

answers

84

views

Is such variant of SAT always satisfiable?

boolean-algebra 3-sat

Sep 10 '17 at 22:51 rus9384 1,267

1

vote

1

answer

79

views

Is it an open problem if generalized resolution is always possible?

algorithms logic satisfiability

Aug 31 '17 at 9:51 Yuval Filmus 232k

0

votes

1

answer

69

views

Understanding kQBF: changing order of quantification?

np-hard boolean-algebra propositional-logic

Aug 25 '17 at 13:08 rus9384 1,267

1

vote

0

answers

65

views

Question about $\mathsf{Almost–PSPACE}$

complexity-theory oracle-machines

Jun 5 '17 at 12:15 David Richerby 77.9k

1

vote

1

answer

63

views

Correctness of following algorithm for 3-QCNF?

algorithms satisfiability

Jun 21 '17 at 18:18 Kyle Jones 6,915

2

votes

1

answer

58

views

If we allow a database, what complexity class it is?

complexity-theory databases oracle-machines

Sep 6 '17 at 7:57 rus9384 1,267

1

vote

0

answers

58

views

Determining when equal 2CNF has pure literal

boolean-algebra formal-methods

Sep 4 '17 at 7:20 rus9384 1,267

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

41 Questions

3-SAT with 3 variable occurences

Why AKS primality test is called polynomial?

$NP \ vs \ co-NP$: tautology to SAT and vice versa?

SAT to knapsack vs. ETH

Reduction from 2-SAT to 2-XOR-SAT?

Satisfiabililty sufficient condition?

Are poly-reductions to PSPACE problems for following problems are known?

Is it possible to prove $\mathsf{BPP = NP}$ statistically?

Linear time multiplication on RAM machine?

Why Djikstra's algorithm is said to have $\mathcal{O}(|V|^2)$ complexity?

Is generating MIN-3-UNSAT $\mathsf{NP}$-hard?

Is this case of weighted 2SAT NP-complete?

Colored cliques complexity

Is boolean formula isomorphism NP-complete?

Was it known that $\mathsf{LTIME \subsetneq NLTIME}$?

Another way to solve SAT. Was it known?

Correct implication for 3SAT from this theorem?

Number of minimal unsatisfiable partial assignments in 2-SAT/3-SAT

Can minimal CNF contain clause longer than initial CNF?

Solving 2-CNF TQBF with #SAT solver?

How can I understand if reduction is Karp reduction?

Is this problem $\mathsf{NEXP}$-complete?

Do we know something about this refutation method for SAT?

Is such variant of SAT always satisfiable?

Is it an open problem if generalized resolution is always possible?

Understanding kQBF: changing order of quantification?

Question about $\mathsf{Almost–PSPACE}$

Correctness of following algorithm for 3-QCNF?

If we allow a database, what complexity class it is?

Determining when equal 2CNF has pure literal