<p>Valiant's classes are defined over some field. They can use arbitrary constants from that field. To draw some conclusion about Boolean complexity classes, one needs to replace these arbitrary constants by small discrete constants. Here GRH comes into play, since it ensures the existence of enough primes with certain properties.</p>

CC BY-SA 3.0
2017-05-08T12:28:59.193Z
2017-05-08T12:28:59.193Z
Markus Bläser
<p>It is known that "Assuming the generalized Riemann hypothesis (GRH) if VP = VNP then PH collapses to second level". Why would one think of a relation between VP,VNP and the Riemann hypothesis. Where does a statement about the zeros of the Riemann zeta function appear in a statement about complexity classes ? I have not read the original result. It would be nice if anyone could provide some intuition. </p>

CC BY-SA 3.0
2017-05-08T08:20:35.240Z
What rings is this statement about? Anyway, the VP and VNP classes are really more "algebraic geometry classes" than "computational complexity classes", so that's why.
Emil Jeřábek
CC BY-SA 3.0
2017-05-08T12:31:30.643Z
How many algebraic geometers can write down the proper definition of VNP ;-)
Markus Bläser
<algebraic-complexity>
Riemann Hypothesis and Complexity Theory
kala
# Riemann Hypothesis and Complexity Theory

(Asked by: username_0 on 2017-05-08)

It is known that "Assuming the generalized Riemann hypothesis (GRH) if VP = VNP then PH collapses to second level". Why would one think of a relation between VP,VNP and the Riemann hypothesis. Where does a statement about the zeros of the Riemann zeta function appear in a statement about complexity classes ? I have not read the original result. It would be nice if anyone could provide some intuition.

**Tags:** algebraic-complexity
> **Comments:**
> **username_1**: What rings is this statement about? Anyway, the VP and VNP classes are really more "algebraic geometry classes" than "computational complexity classes", so that's why.  
> **username_2**: How many algebraic geometers can write down the proper definition of VNP ;-)  

---

## 1 answers

### Answer by username_2 on 2017-05-08. Score: 6

Valiant's classes are defined over some field. They can use arbitrary constants from that field. To draw some conclusion about Boolean complexity classes, one needs to replace these arbitrary constants by small discrete constants. Here GRH comes into play, since it ensures the existence of enough primes with certain properties.


---

