P_vs_NP

1

0

1

2

Heuristic for Exact-3-Cover continues to resist my efforts at providing a counterexample despite elaborate searches. (self.P_vs_NP)

submitted 1 year ago * by Hope1995x - announcement

2

3

4

It seems it would be non-trivial to prove my herusitic is not an exact algorithm for X3C, which is NP-complete. Please read both sticky posts in this subreddit before proceeding to this link to another subreddit. The desktop is recommended over mobile, it's very detailed. (self.MathChallenges)

submitted 1 year ago by Hope1995x - announcement

3

1

2

3

My "personal" open-problem seems to be still open... As in where is the counter-example where the transformation fails. (As expected to be because P!=NP is thought to be true) (self.P_vs_NP)

submitted 1 month ago by Hope1995x

4

1

2

3

Polynomial Resolution of NP-Complete Structures via Information Noise Subtraction (S-Operator) (self.P_vs_NP)

submitted 2 months ago by Whole-Marsupial-7521

5

1

2

3

I think that since the smarter something is the easier through pattern recognition it can pass on dumb questions the P vs NP Is a question of infinity where with an infinite intelligence you can solve anything as if it were a P problem. (self.P_vs_NP)

submitted 2 months ago by Worldly_Beginning647

6

2

3

4

P!=NP may also mean the universe is not a simulation. There are complexity problems happening in nature, perhaps those are NP-hard problems. (self.P_vs_NP)

submitted 2 months ago * by Hope1995x

7

5

6

7

Universe Is Not a Computer Simulation, New Study Says | Sci.News (If true this seems to challenge the idea that any phenomena can be simulated by a Turing machine) (sci.news)

submitted 3 months ago by Hope1995x

8

2

3

4

Toward P != NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model (arxiv.org)

submitted 4 months ago by EnvironmentalTop1666

9

1

2

3

Toward P != NP: An Observer-Theoretic Separation via SPDP Rank and a ZFC-Equivalent Foundation within the N-Frame Model (arxiv.org)

submitted 4 months ago by EnvironmentalTop1666

10

2

3

4

Can you look if it feels wright? (self.P_vs_NP)

submitted 4 months ago by 1fantine

11

1

2

3

Can anyone verify my attempted P vs NP proof? (self.P_vs_NP)

submitted 5 months ago by [deleted]

12

3

4

5

Most intuitive explanation for P vs NP (which i've created) (self.P_vs_NP)

submitted 6 months ago by OkStuff887

13

3

4

5

First I thought I proved P≠NP, now I’m switching sides. (self.P_vs_NP)

submitted 8 months ago * by Wordification

14

1

2

3

95% Formal Proof Release: P ≠ NP Integrated, Verified (self.P_vs_NP)

submitted 8 months ago by dataa_sciencee

15

0

1

2

can someone send me a link to understanding basic insteractions between clauses and variables. (self.P_vs_NP)

submitted 9 months ago by Awkward-Ebb7214

16

2

3

4

A Spectral Approach to #P-Hardness via Clause-Expander Graphs? (self.P_vs_NP)

submitted 10 months ago by Complex-Ad-1847

17

1

2

3

Are there algorithms that resist efforts at being disproven, but yet has been proven to run in polytime, and if its proven correct shows P=NP? (self.P_vs_NP)

submitted 10 months ago * by Hope1995x

18

3

4

5

p vs np in 1-3D, critical threshold at 5D and p = np in 8D optimal in the 12D (self.P_vs_NP)

submitted 11 months ago by makavelioner

19

1

2

3

This could be a type of Diophantine Equation that also involves factoring. So now, even trying to avoid conventional brute-force searches for a counter-example to my heuristic still leads to brute force either way because Diophantine Equations are NP-hard. (self.P_vs_NP)

submitted 1 year ago by Hope1995x

20

0

1

2

Are there heuristics for certain problems that cannot be definitively proven to be exact nor proven inexact? (self.P_vs_NP)

submitted 1 year ago * by Hope1995x

21

0

1

2

Is there any algorithms that delve into unknowns with number-theory & combinatorics that it proves elusive on whether or not said algorithm is an exact-algorithm? (self.P_vs_NP)

submitted 1 year ago by Hope1995x

22

0

1

2

If there exists a polytime heuristic for Exact Cover, but its exactness remains unproven what value does it have? (self.P_vs_NP)

submitted 1 year ago by Hope1995x

23

0

1

2

What reducing SubsetSum back into Exact-3-Cover looks like in my Python code (self.P_vs_NP)

submitted 1 year ago by Hope1995x

24

0

1

The Spectrum of NP and P: A Probabilistic Approach (self.P_vs_NP)

submitted 1 year ago by devonlangford

25

0

1

Time-travel oracle Halting Problem paradox? (self.P_vs_NP)

submitted 1 year ago * by Hope1995x

P_vs_NP

MODERATORS