Network profile

rus9384

Reputation

1,309

1.3k
1.3k
1.2k

Top tag

complexity-theory

Next privilege

2,000 Rep.

Edit questions and answers

Badges

Newest

Next badge

0/1

Impact

1 post edited

6 helpful flags

68 votes cast

45 Questions

Votes Activity Newest Views

vote

answer

511

views

SAT to knapsack vs. ETH

Aug 18 '17 at 15:51 Ariel 12.3k

vote

answers

125

views

Correct implication for 3SAT from this theorem?

complexity-theory np-complete satisfiability

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

vote

answer

200

views

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

np-hard satisfiability boolean-algebra 3-sat

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

vote

answer

views

How 2-QCNF algorithm works?

graphs satisfiability 2-sat

Aug 7 '17 at 12:58 Yuval Filmus 249k

vote

answer

107

views

How can I understand if reduction is Karp reduction?

reductions

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

vote

answer

views

Correctness of following algorithm for 3-QCNF?

algorithms satisfiability

Jun 21 '17 at 18:18 Kyle Jones 7,270

vote

answers

views

Question about $\mathsf{Almost–PSPACE}$

complexity-theory oracle-machines

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

vote

answers

views

Why AKS primality test is called polynomial?

complexity-theory

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

votes

answers

views

Are all reductions from NP-complete problems either NP-complete or are contained in P?

complexity-theory reductions np

Oct 25 at 18:48 rus9384 1,309

votes

answers

views

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

complexity-theory

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

votes

answer

130

views

Another way to solve SAT. Was it known?

satisfiability sat-solvers

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

votes

answer

views

Understanding kQBF: changing order of quantification?

np-hard boolean-algebra propositional-logic

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

votes

answer

views

Is following SAT case in $\mathsf{P}$?

complexity-theory satisfiability 3-sat

Jun 9 '17 at 4:47 Raphael♦ 69.4k

votes

answer

160

views

Colored cliques complexity

complexity-theory graphs clique

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

votes

answer

282

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 12.3k

Prev 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

45 Questions

SAT to knapsack vs. ETH

Correct implication for 3SAT from this theorem?

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

How 2-QCNF algorithm works?

How can I understand if reduction is Karp reduction?

Correctness of following algorithm for 3-QCNF?

Question about $\mathsf{Almost–PSPACE}$

Why AKS primality test is called polynomial?

Are all reductions from NP-complete problems either NP-complete or are contained in P?

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

Another way to solve SAT. Was it known?

Understanding kQBF: changing order of quantification?

Is following SAT case in $\mathsf{P}$?

Colored cliques complexity

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