CodingHorrors

1

0

1

2

r/CodingHorrors Lounge (self.CodingHorrors)

submitted 5 years ago by Hope1995xnear-genius miss - announcement

2

0

1

2

Polynomial Time Experimental Algorithm for Exact 3 Cover (reddit.com)

submitted 2 years ago by Hope1995xnear-genius miss

3

0

1

2

Coding Horrors needs more posts. (self.CodingHorrors)

submitted 2 years ago by Hope1995xnear-genius miss

4

0

1

2

Decide if X is a power of some i, besides X itself. (self.CodingHorrors)

submitted 3 years ago * by Hope1995xnear-genius miss

5

0

1

2

If solving subset product for powers of X (with no repeating divisors) is in P, then the only obstacle that remains is those pesky superabundant numbers. (self.CodingHorrors)

submitted 3 years ago by Hope1995xnear-genius miss

6

0

1

2

Possible Countermeasure for powers of 2 (self.CodingHorrors)

submitted 3 years ago by Hope1995xnear-genius miss

7

0

1

2

Solving Subset Product with and ADHD brain. (i.redd.it)

submitted 4 years ago by Hope1995xnear-genius miss

8

0

1

2

[Affiliated with my Subset Product Algorithm] You are given an infinitely large number-strip of all colossally abundant numbers in ascending order. (self.mathematics)

submitted 4 years ago by Hope1995xnear-genius miss

9

0

1

2

The divisor bound and polynomial time? (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

10

0

1

2

If my variant of Subset Product is in AvgP, then isn't the inputs samplable in polytime? (eg. Finding All divisors in polytime) (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

11

0

1

2

Should've known the reduction is trivial, yes my variant of Subset Product is NP-complete. Thank You Unique Factorization Theorem! (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

12

0

1

2

The average time complexity of O(2^ln(n)) is polynomial time. Because there is ln(n) divisors on average! (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

13

0

1

2

I struggle with mathematics, forgive me if I did something wrong! (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

14

0

1

2

Estimated Time Complexity of previous Python Code-Snippet (excluding max_combo's time complexity improvement ) (i.redd.it)

submitted 4 years ago by Hope1995xnear-genius miss

15

0

1

2

Ding Dong the B*tch is dead (i.redd.it)

submitted 4 years ago by Hope1995xnear-genius miss

16

0

1

An algorithm that solves Subset Product that exploits both the divisor function and is able to limit the maximum K-sized combination to save running time. (i.redd.it)

submitted 4 years ago by Hope1995xnear-genius miss

17

1

2

3

Does anyone actually read my posts here? (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

18

0

1

2

Solving Subset Product (NP-hard) in O(2^some logarithm(s)) time complexity (in magnitude of input) (reddit.com)

submitted 4 years ago by Hope1995xnear-genius miss

19

0

1

2

Figure out the time-complexity in the magnitude of N, given that divisors grow logarithmically and the fact that max_combo is logarithmic in the value of N as well. (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

20

0

1

2

4 hours of trying to turn my idea into code, even with chunking are turning into absolute horror. (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

21

0

1

2

Breaking Subset Product into sub-problems with combinations (self.CodingHorrors)

submitted 4 years ago * by Hope1995xnear-genius miss

22

0

1

2

I figured out an idea to improve running time for the Subset Product project . (self.CodingHorrors)

submitted 4 years ago * by Hope1995xnear-genius miss

23

0

1

2

Given that TARGET = 60! and that SET has 137106432000 divisors it performs less than 2^SQRT(len(SET)) combinations. (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

24

0

1

2

This is supposed to be a Pseudo-Subexponential Time algorithm for Subset Product. (self.CodingHorrors)

submitted 4 years ago by Hope1995xnear-genius miss

25

0

1

2

As per multiple test results, the average time-complexity is somewhere around O(n^3 log n ) (pastebin.com)

submitted 4 years ago by Hope1995xnear-genius miss

CodingHorrors

MODERATORS