TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

NP-hard SAT and CSP problems which admit exponentially improved algorithms

5 pointsby ceviover 3 years ago

1 comment

ceviover 3 years ago
The arxiv version isn&#x27;t very different from the published version, if you end up facing a paywall: <a href="https:&#x2F;&#x2F;arxiv.org&#x2F;pdf&#x2F;1801.09488.pdf" rel="nofollow">https:&#x2F;&#x2F;arxiv.org&#x2F;pdf&#x2F;1801.09488.pdf</a>