However, this method requires a specific finite obstruction set to work, and the theorem does not provide one. The theorem proves that such a finite obstruction set exists, and therefore the problem is polynomial because of the above algorithm. However, the algorithm can be used in practice only if such a finite obstruction set is provided. As a result, the theorem proves that the problem can be solved in polynomial time, but does not provide a concrete polynomial-time algorithm for solving it. Such proofs of polynomiality are non-constructive: they prove polynomiality of problems without providing an explicit polynomial-time algorithm.[14] In many specific cases, checking whether a graph is in a given minor-closed family can be done more efficiently: for example, checking whether a graph is planar can be done in linear time.
![:gigachadglow: :gigachadglow:](/e/gigachadglow.webp)
The era of cryptography is over, chud (maybe)
https://en.wikipedia.org/wiki/Robertson%E2%80%93Seymour_theorem
- 20
- 43
Jump in the discussion.
No email address required.
What makes you think that this implies that prime factorization is a polynomial-time problem?
Jump in the discussion.
No email address required.
I like dramacoins, sir.
maybe
@everyone could better explain this to you
Jump in the discussion.
No email address required.
More options
Context
Cryptology*
Jump in the discussion.
No email address required.
More options
Context
Cryptography is truly cracked.
Jump in the discussion.
No email address required.
More options
Context
Infinity isnt a number.
Jump in the discussion.
No email address required.
More options
Context
More options
Context
Is there anything implying all encryption algos are equivalent to a graph minor problem? If not this is pretty meaningless.
Jump in the discussion.
No email address required.
P==NP
Jump in the discussion.
No email address required.
More options
Context
More options
Context
Snapshots:
archive.org
archive.ph (click to archive)
ghostarchive.org (click to archive)
Jump in the discussion.
No email address required.
Yes, snappy. The honourable mujāhidīn will have an hard time communicating without being eavesdropped by Uncle Sam
Jump in the discussion.
No email address required.
More options
Context
More options
Context
What does this have to do with cryptography?
Jump in the discussion.
No email address required.
The embargo on the CVE drops next week. I suggest puts on tech stocks in the run up.
Jump in the discussion.
No email address required.
More options
Context
More options
Context
Wrong
Jump in the discussion.
No email address required.
More options
Context
What
Jump in the discussion.
No email address required.
More options
Context
Jump in the discussion.
No email address required.
More options
Context
non constructive proofs reeeee![:marseyraging: :marseyraging:](/e/marseyraging.webp)
Jump in the discussion.
No email address required.
More options
Context
keep away from the Forbidden Minors
Jump in the discussion.
No email address required.
More options
Context
I thought this was going to be a link to Shor’s algo.
Follower of Christ
Tech lover, IT Admin, heckin pupper lover and occasionally troll. I hold back feelings or opinions, right or wrong because I dislike conflict.
Jump in the discussion.
No email address required.
More options
Context
Jump in the discussion.
No email address required.
More options
Context