Toggle navigation
HN
Paper
All
Show
Ask
Jobs
Top stories
Today
Last 7 days
Last months
This year
Stats
Stories by vicentesteve
Safe communication to a quantum cloud from classic clients is possible?
1 points
vicentesteve
2025-05-24T01:47:21Z
www.researchgate.net
Can a classic client use a quantum server safely?
1 points
vicentesteve
2025-05-22T22:11:35Z
www.researchgate.net
Definitive solution to the hardest problem in computing: P = NP?
22 points
vicentesteve
2025-05-19T21:23:27Z
www.researchgate.net
Solution of the biggest Computational Problem P vs. NP
3 points
vicentesteve
2025-05-18T19:15:47Z
www.researchgate.net
Universal Blind and Verifiable Delegated Quantum Computation with Classic Client
1 points
vicentesteve
2025-05-18T10:26:57Z
www.researchgate.net
A new formal attempt at P ≠ NP avoiding known barriers
2 points
vicentesteve
2025-05-16T10:56:50Z
www.researchgate.net
Universal Blind and Verifiable Delegated Quantum Computation with Classic Client
2 points
vicentesteve
2025-05-14T23:01:11Z
www.researchgate.net
A constructive proof that P ≠ NP using circuit-resistant encodings
4 points
vicentesteve
2025-05-11T10:23:37Z
doi.org
A constructive proof that P ≠ NP using circuit-resistant encodings
2 points
vicentesteve
2025-05-05T08:44:40Z
doi.org
Universal Blind and Verifiable Delegated Quantum Computation Classic Client
1 points
vicentesteve
2025-04-26T15:57:52Z
zenodo.org
Universal Blind and Verifiable Quantum Computation with Classical Clients
1 points
vicentesteve
2025-04-23T21:52:47Z
doi.org