Network profile

dspyz

Reputation

846

2018
2019
2020
2021

Top tag

np-hardness

Next privilege

1,000 Rep.

See votes

Badges

Newest

Next badge

0/1

Impact

0 posts edited

0 helpful flags

29 votes cast

13 Questions

Votes Activity Newest Views

votes

answers

views

Is Almost-2-SAT NP-hard?

Dec 20 '13 at 13:05 András Salamon 18.4k

votes

answer

216

views

Does the 0-1 principle apply to merge networks?

sorting-network

Aug 10 '14 at 11:06 Community♦ 1

votes

answer

380

views

Would an optimal sorting network ever have to swap two numbers the “wrong” way

sorting proofs intuition sorting-network

Jun 26 '14 at 18:00 Peter Shor 23k

votes

answer

378

views

Worst case ratio between minimum clique cover and maximum independent set

co.combinatorics approximation-algorithms graph-colouring set-cover clique

Feb 5 '14 at 22:50 Sasho Nikolov 17.8k

votes

answer

266

views

Asymptotic complexity of CDCL SAT solver that only selects negative literals

sat

Jul 20 '16 at 13:27 dspyz 846

votes

answer

views

Translating pure literal elimination into rup

sat cdcl pure-literal-elimination unit-propagation

Sep 2 at 21:59 Kyle Jones 601

votes

answers

183

views

Most general form of SAT which is in P

sat polynomial-time resolution

Dec 3 '13 at 22:02 dspyz 846

votes

answer

901

views

How to approximate minimum clique edge cover

graph-algorithms approximation-algorithms set-cover clique

Feb 7 '13 at 12:10 Falk Hüffner 1,003

vote

answers

views

Find all paths between specially paired nodes in a DAG in linear time

time-complexity directed-acyclic-graph 2sat

Aug 30 at 0:51 dspyz 846

vote

answers

views

Best Asymptotic Complexity for Persistent Union Find

ds.data-structures time-complexity functional-programming

Apr 1 '16 at 19:28 dspyz 846

votes

answers

263

views

Terminology for complete k-partite graph where k is not fixed

graph-theory terminology clique

Feb 18 '14 at 18:25 user13136 2,437

votes

answers

190

views

Finding assignment-minimum complete k-partite graph cover

graph-theory graph-algorithms approximation-algorithms set-cover clique

Aug 26 '13 at 0:39 dspyz 846

-2

votes

answer

views

Assign each biclique to a distinct left

graph-theory

Dec 19 '14 at 3:54 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

13 Questions

Is Almost-2-SAT NP-hard?

Does the 0-1 principle apply to merge networks?

Would an optimal sorting network ever have to swap two numbers the “wrong” way

Worst case ratio between minimum clique cover and maximum independent set

Asymptotic complexity of CDCL SAT solver that only selects negative literals

Translating pure literal elimination into rup

Most general form of SAT which is in P

How to approximate minimum clique edge cover

Find all paths between specially paired nodes in a DAG in linear time

Best Asymptotic Complexity for Persistent Union Find

Terminology for complete k-partite graph where k is not fixed

Finding assignment-minimum complete k-partite graph cover

Assign each biclique to a distinct left