Victoria Stuart 🇨🇦 🏳️‍⚧️Jul 25, 2025

These are clever people: Quantum Scientists Building New Math of Cryptography
https://www.quantamagazine.org/quantum-scientists-have-built-a-new-math-of-cryptography-20250725/
One-way function
https://en.wikipedia.org/wiki/One-way_function
Quantum cryptography
https://en.wikipedia.org/wiki/Quantum_cryptography
Permanent (mathematics)
https://en.wikipedia.org/wiki/Permanent_(mathematics)
♯P-completeness of 01-permanent
https://en.wikipedia.org/wiki/%E2%99%AFP-completeness_of_01-permanent

#mathematics #cryptography #OneWayFunctions #LinearAlgebra #matrices #QuantumCryptography #NPhard

Quantum Scientists Have Built a New Math of Cryptography | Quanta Magazine

In theory, quantum physics can bypass the hard mathematical problems at the root of modern encryption. A new proof shows how.

Quanta Magazine
GilgwathApr 26, 2025
The fact that we've been building #computer #printers since the 60ies and we still haven't found a solution that really works, makes me think #printing is actually NP-hard. #nphard #nphardproblems #computers #computerscience
Jan  Sep 1, 2024

Compiling #Rust is NP-hard (July 2021) - by compilercrimes

https://compilercrim.es/rust-np/

"...though it's not the flagship borrow checking that's at fault. What I noticed, and would like to share with you today, is that the exhaustiveness checking performed by the Rust compiler on match patterns is a superset of the #SAT problem."

#NPHard #RustLang #Compiler

Compiling Rust is NP-hard

...though it's not the flagship borrow checking that's at fault. What I noticed, and would like to share with you today, is that the exhaustiveness checking performed by the Rust compiler on match patterns is a superset of the SAT problem.

urmaulAug 30, 2024

On September 10 I will be presenting a talk “When your problem is NP-hard” at Gurtam DevConf in Vilnius. Join if you’re interested in practical approaches to optimization problems.

https://be.gurtam.com/conf/gurtamdevconf

#GurtamDevConf #conference #Vilnius #NPHard

Gurtam Company's All-in-One Hub for Stay-Updated: Events, Social Happenings, and News

Explore Gurtam Company's centralized hub to stay informed about the latest events, social gatherings, and breaking news. Discover a convenient, one-stop platform for all things Gurtam, ensuring you never miss out on important updates. Join our vibrant community and keep your finger on the pulse of Gurtam's exciting developments.

Show threadJim MeyerApr 9, 2024
@kellan i’m not sure noise canceling technology has advanced quite *that* far. #nphard
@infosec_jcp 🐈🃏 done differentlyOct 10, 2023

Mayyyyyybe the #TandSTeams wasn't such a flex on laying off unless #fines was the plan... All along was, I.T.?

#Governance is an #NPHard (?) equation or is this defined by a #ToS ? Hmm....

Ooooh, I know! Mayyyybe iF you APPLY the #ToS by STAFFING #TandSTeams ? ¯\_ಠ◡ಠ_/¯

THAT'S. WHAT. T&S. DOES?

¯\_ಠ_ಠ_/¯ @yoyoel

Chris PhanAug 11, 2023

Target app goes #NPhard!

#TravelingSalespersonProblem #CSinEverydayLife #algorithims

BornachJul 20, 2023

#BingChat (precise) has concluded that P=NP

I asked it to write a Python script that when given a graph where there are no more than 5 edges for every vertex, it returns the length of the longest path that visits each vertex no more than once. Then lifted the edge count restriction.

In both cases it claimed polynomial time complexity to solve an NP-hard problem

#ComputerScience #complexity #PequalsNP #NPhard #NPcomplete #python #GraphTheory

xameerMar 6, 2021
You can use function overloading in #swift to crack 3-sat problem #nphard
but your type inference ( which usually means a type is checked it the context remembers it ) becomes a mess at you need to add more rules to your type system, you use sub-typing , which becomes a mess as