The Naked Scientists
  • Login
  • Register
  • Podcasts
      • The Naked Scientists
      • eLife
      • Naked Genetics
      • Naked Astronomy
      • In short
      • Naked Neuroscience
      • Ask! The Naked Scientists
      • Question of the Week
      • Archive
      • Video
      • SUBSCRIBE to our Podcasts
  • Articles
      • Science News
      • Features
      • Interviews
      • Answers to Science Questions
  • Get Naked
      • Donate
      • Do an Experiment
      • Science Forum
      • Ask a Question
  • About
      • Meet the team
      • Our Sponsors
      • Site Map
      • Contact us

User menu

  • Login
  • Register
  • Home
  • Help
  • Search
  • Tags
  • Recent Topics
  • Login
  • Register
  1. Naked Science Forum
  2. On the Lighter Side
  3. New Theories
  4. What makes NP problems hard to solve?
« previous next »
  • Print
Pages: 1 [2]   Go Down

What makes NP problems hard to solve?

  • 23 Replies
  • 12012 Views
  • 1 Tags

0 Members and 1 Guest are viewing this topic.

Offline alancalverd

  • Global Moderator
  • Naked Science Forum GOD!
  • ********
  • 21160
  • Activity:
    66.5%
  • Thanked: 60 times
  • Life is too short for instant coffee
Re: What makes NP problems hard to solve?
« Reply #20 on: 12/03/2025 16:17:40 »
AFAIK eggs are graded by weight but sold by number within a weight category, so placing 6, 12 or occasionally 15 eggs in a compartmentalised box labelled "large", "medium" or  "mixed" becomes a P problem. But I heard a delightful exchange on an Irish radio phone-in some years ago:

"So the Health Department tells us it's OK to eat an egg every day."
 - "Yes, I've heard that".
"But there's only six in a box"
- "So what do you want to do about it?"
"Can we abolish Tuesdays?"

Thus neatly solving an NP problem.   

Logged
Helping stem the tide of ignorance
 



Offline hamdani yusuf (OP)

  • Naked Science Forum GOD!
  • *******
  • 11803
  • Activity:
    76%
  • Thanked: 285 times
Re: What makes NP problems hard to solve?
« Reply #21 on: 19/03/2025 14:37:05 »
Quote from: hamdani yusuf on 18/01/2025 12:45:09
Basically, complexity of a problem depends on the size of its search space, and the size of impact and cost of each step or iteration in solving it.
The cost of each step or iteration in solving a problem can also be made arbitrarily high. This can be useful for preventing brute force attacks. Instead of directly comparing the answer with the guessed value, you can make the algorithm to execute a function with arbitrary complexity using the guessed valve as the input. Only then you can verify if the guessed value matches the result using the correct answer.
So, basically the complexity of a problem can be mapped at least in three dimensional continuum of free parameter axes, which are the size of its search space, and the size of impact and cost of each step or iteration in solving it. 
« Last Edit: 20/03/2025 11:45:01 by hamdani yusuf »
Logged
Unexpected results come from false assumptions.
 

Offline hamdani yusuf (OP)

  • Naked Science Forum GOD!
  • *******
  • 11803
  • Activity:
    76%
  • Thanked: 285 times
Re: What makes NP problems hard to solve?
« Reply #22 on: 21/03/2025 09:23:44 »
I can prove I?ve solved this Sudoku without revealing it
Quote
I can convince you that I?ve solved a sudoku without giving you any information about my solution. We discuss how to do this using what cryptographers call a zero-knowledge proof, and how the same tricks can be used for almost any other problem you can think of.


0:00 Intro
0:50 Interactive proofs
2:28 Graph coloring
3:22 A simple protocol
6:31 Building the full protocol
10:24 Commitment schemes
12:37 Reducing sudoku to coloring
14:28 General reduction
17:04 Discussion
19:09 Outro
Logged
Unexpected results come from false assumptions.
 

Offline hamdani yusuf (OP)

  • Naked Science Forum GOD!
  • *******
  • 11803
  • Activity:
    76%
  • Thanked: 285 times
Re: What makes NP problems hard to solve?
« Reply #23 on: 02/05/2025 05:03:20 »
But what is quantum computing? (Grover's Algorithm)
Quote
Qubits, state vectors, and Grover's algorithm for search.
Instead of sponsored ad reads, these lessons are funded directly by viewers: https://3b1b.co/support
An equally valuable form of support is to share the videos.

The subtitles on this video were done using AI, and are likely imperfect, but they are open for community corrections at https://criblate.com/

Adam Brown's paper on the connection between Grover's Algorithm and block collisions:
https://arxiv.org/pdf/1912.02207

Timestamps:
0:00 - Misconceptions
6:03 - The state vector
12:00 - Qubits
15:52 - The vibe of quantum algorithms
18:38 - Grover?s Algorithm
29:30 - Support pitch
30:11 - Complex values
31:27 - Why square root?
34:01 - Connection to block collisions
35:08 - Additional resources

------------------
Logged
Unexpected results come from false assumptions.
 



  • Print
Pages: 1 [2]   Go Up
« previous next »
Tags: p vs np 
 
There was an error while thanking
Thanking...
  • SMF 2.0.15 | SMF © 2017, Simple Machines
    Privacy Policy
    SMFAds for Free Forums
  • Naked Science Forum ©

Page created in 0.399 seconds with 31 queries.

  • Podcasts
  • Articles
  • Get Naked
  • About
  • Contact us
  • Advertise
  • Privacy Policy
  • Subscribe to newsletter
  • We love feedback

Follow us

cambridge_logo_footer.png

©The Naked Scientists® 2000–2017 | The Naked Scientists® and Naked Science® are registered trademarks created by Dr Chris Smith. Information presented on this website is the opinion of the individual contributors and does not reflect the general views of the administrators, editors, moderators, sponsors, Cambridge University or the public at large.