dspyz

Member for 9 years, 3 months
Last seen more than a month ago

Summary

Reputation

916

916
852
788

2019
2020
2021
2022

Top tag

np-hardness

Next privilege

1,000 Rep.

See votes

Badges

4

13

Newest

Popular Question

Next badge

0/1

Custodian

Questions

View all 15 questions

Score Activity Newest Views

10

Is Almost-2-SAT NP-hard?

Dec 19, 2013

6

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

Jun 26, 2014

6

Does the 0-1 principle apply to merge networks?

Aug 10, 2014

5

Worst case ratio between minimum clique cover and maximum independent set

Feb 5, 2014

5

Can a normal form term be extensionally equivalent to a term with no WHNF?

Dec 6, 2021

Answers

View all 8 answers

Score Activity Newest

8

Is Almost-2-SAT NP-hard?

Dec 20, 2013

3

Can a normal form term be extensionally equivalent to a term with no WHNF?

Dec 6, 2021

2

Are there any problems whose best known algorithm has run time $O\left(\frac{f(n)}{\log n}\right)$

Feb 7, 2013

2

M-clique covers in complete graphs

Jan 17, 2014

1

Transitive feedback arc set (TFAS): NP-complete?

Jan 29, 2014

Tags

View all 30 tags

np-hardness

9

Score

3

posts

sat

8

Score

5

posts

upper-bounds

8

Score

2

posts

ds.algorithms

5

Score

3

posts

graph-theory

4

Score

7

posts

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

This user doesn’t have any gold badges yet.

4

silver badges

Yearling

× 4

Aug 31, 2020

13

bronze badges

Self-Learner

Dec 20, 2013
Quorum

Dec 31, 2014
Curious

Jul 2, 2014

Bookmarks

Score Activity Newest Views Added

This user has no bookmarked questions.

Accounts

View all 37 accounts

5,080
2
20
58

925
6
18

Theoretical Computer Science

916
4
13

Science Fiction & Fantasy

875
7
12

Meta Stack Exchange

861
5
7

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

28

upvotes

1

downvotes

10

question votes

19

answer votes