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

1 points by frjalex 5y ago ↗ HN

0 comments

[ 25.6 ms ] story [ 1764 ms ] thread

No comments yet.

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

Source · Live DB stats