Network profile

rus9384

Reputation

1,267

1.3k
1.2k
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

64 votes cast

43 Questions

Votes Activity Newest Views

vote

answer

186

views

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

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

vote

answer

views

How 2-QCNF algorithm works?

graphs satisfiability 2-sat

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

vote

answer

views

How can I understand if reduction is Karp reduction?

reductions

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

vote

answer

views

Correctness of following algorithm for 3-QCNF?

algorithms satisfiability

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

vote

answers

views

Question about $\mathsf{Almost–PSPACE}$

complexity-theory oracle-machines

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

vote

answers

views

Why AKS primality test is called polynomial?

complexity-theory

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

votes

answers

views

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

complexity-theory reductions np

1d ago rus9384 1,267

votes

answers

views

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

complexity-theory

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

votes

answer

122

views

Another way to solve SAT. Was it known?

satisfiability sat-solvers

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

votes

answer

views

Understanding kQBF: changing order of quantification?

np-hard boolean-algebra propositional-logic

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

votes

answer

views

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

complexity-theory satisfiability 3-sat

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

votes

answer

157

views

Colored cliques complexity

complexity-theory graphs clique

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

votes

answer

256

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

Prev 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

43 Questions

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?