On the difficulty of proving P=NP in ZFC (arxiv.org)

1 points by frjalex 6y ago ↗ HN

0 comments

[ 32.0 ms ] story [ 99.8 ms ] thread

No comments yet.

A showcase of shard-db. Data from the Hacker News API. Refreshed every 15 minutes.

Source · Live DB stats