aan1092j

4 ms·

1. 1.▲
   by aan1092j 5y ago

   I'm with you. SSC posts are high on rhetoric and low on actual conceptual knowledge/insights. The examples are ridiculously long and somewhat contrived. s.
2. 2.▲
   by aan1092j 5y ago

   Ah my bad. I wrote hastily and did not consider the full implication of the word `forced`, i.e. it would involve proving the opponent has no winning options.
3. 3.▲
   by aan1092j 5y ago

   For problems in NP (i.e. for which a solution can be verified in polynomial time), we can construct a Zero Knowledge Proof by reducing it to 3SAT, then constructing a PCP (Probabilistically checkable proof). T̶h̶e̶ ̶p̶r̶o̶b̶l̶e̶m̶ ̶o̶f̶ ̶d