mjqxxxx

Member for 12 years, 11 months
Last seen more than a week ago

Summary

Reputation

1,458

1.5k
1.4k
1.4k

2020
2021
2022
2023

Top tag

cc.complexity-theory

Next privilege

2,000 Rep.

Edit posts

Badges

13

21

Newest

Yearling

Next badge

0/1

Custodian

Answers

View all 18 answers

Score Activity Newest

18

Is the "Fewest Discriminating Bits" problem NP-complete?

Jan 14, 2011

14

Are there any natural hard problems where it is required that the number of solutions are always more than one?

Jan 30, 2011

13

SUBSET-SUM with binary - unary - "positional" encoding

Jan 14, 2011

10

Is it possible to find if a sequence exists in polynomial time in the following problem?

Feb 1, 2011

9

Are there local maxima in the number of moves required to solve a Rubik's Cube?

Jan 17, 2011

Questions

Score Activity Newest Views

13

Reversing a list using two queues

Jan 14, 2011

Tags

View all 28 tags

cc.complexity-theory

60

Score

7

posts

np-hardness

33

Score

3

posts

co.combinatorics

23

Score

4

posts

ds.algorithms

21

Score

5

posts

sorting

18

Score

3

posts

Reputation

+10

Are there any natural hard problems where it is required that the number of solutions are always more than one?

+10

Reversing a list using two queues

+10

Is the "Fewest Discriminating Bits" problem NP-complete?

+10

Computing sum of sparse polynomials squared in O(n log n) time?

Badges

View all badges

This user doesn’t have any gold badges yet.

13

silver badges

Enthusiast

Feb 10, 2011
Necromancer

× 2

Sep 24, 2015
Enlightened

× 3

Aug 25, 2011

21

bronze badges

Altruist

Mar 16, 2011
Investor

Mar 9, 2011
Mortarboard

Jan 14, 2011

Accounts

View all 9 accounts

40.8k
3
59
108

Theoretical Computer Science

1,458
13
21

151

136
2

Board & Card Games

101

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

50

upvotes

2

downvotes

42

question votes

10

answer votes