Questions tagged [np]

6 questions
2
votes
1 answer

Does the paper “A Heuristic Proof of P ≠ NP” actually prove that P ≠ NP?

I saw a paper on eprint that says 'A Heuristic Proof of P ≠ NP', does this mean that P ≠ NP has been proven? The URL of the paper is: https://eprint.iacr.org/2024/2035.
Ji Li
  • 137
  • 8
2
votes
1 answer

probabilistic polynomial-time Turing machine with one-way function

Suppose that there exists a function $:\{0,1\}^ → \{0,1\}^$ such that, is computable in polynomial time; and the following task cannot be computed in polynomial time (that is, there are $ ∈ \{0,1\}^$, for which, it cannot be computed…
2
votes
2 answers

How to prove that $$ is in $\mathsf{NP} \setminus \mathsf{P}?$

Suppose that there exists a function $:\{0,1\}^ → \{0,1\}^$ such that, is computable in polynomial time; and the following task cannot be computed in polynomial time (that is, there are $ ∈ \{0,1\}^$, for which, it cannot be computed…
Xoxoxo
  • 45
  • 5
2
votes
1 answer

3-Coloring Zero-Knowledge Proof: rational verifier?

I'm studying the application of Zero-Knowledge Proofs (ZKP) to graph 3-colorability. I haven't fully understood the need for randomness in the verifier's choice of the edge to challenge the prover with. If the verifier could choose the edge to…
Tom_tomato
  • 23
  • 4
1
vote
3 answers

P versus semi-NP?

I am not sure to fully understand the interest of the P versus NP problem for cryptography. I get that it is important to have a problem which is hard to solve but easy to check. But it seems to me that for cryptography purposes, the problem always…
Marc Dinh
  • 113
  • 3
0
votes
0 answers

One-way function constructed by multivariable polynomials

Although the conjecture regarding the existence of one-way functions remained open, there are numerous NP-based methods for constructing diverse one-way functions, including DL, lattice, and subset sum problems. Recently, I have been endeavoring to…
X.H. Yue
  • 498
  • 3
  • 11