4 ms·
Solving polynomials over finite fields is trivial. Just try all combinations.
by meindnoch 6mo ago
Solving polynomials over finite fields is trivial. Just try all combinations.
- eru 6mo agoYou probably want a fast algorithm. Compare https://arxiv.org/abs/1108.1791 https://arxiv.org/abs/1108.1791 and why computational complexity is often more interesting that computability.
- bawolff 6mo agoSure, i guess i should have said something like with a polynomial circuit size or something. However by the same token couldn't you use the same brute force approach with exp minus log? What im really asking, are NAND gates really different here?
- zeroonetwothree 6mo agoHow can you brute force real numbers?
- bawolff 6mo agoI meant for finite fields like the person i was responding to said.