A Formal Proof of Complexity Bounds on Diophantine Equations (arxiv.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of arxiv.org: A Formal Proof of Complexity Bounds on Diophantine Equations

First screen, captured 1 year ago.

Looks similar

Screenshot of arxiv.org: X X^t can be faster

X X^t can be faster (arxiv.org)

188 points by robinhouston 1 year ago | 57 comments

Screenshot of arxiv.org: Geometry from Quantum Temporal Correlations

Geometry from Quantum Temporal Correlations (arxiv.org)

45 points by ljosifov 1 year ago | 21 comments

Screenshot of arxiv.org: LLMs are more persuasive than incentivized human persuaders

LLMs are more persuasive than incentivized human persuaders (arxiv.org)

109 points by flornt 1 year ago | 87 comments

Screenshot of arxiv.org: Sugar-Coated Poison: Benign Generation Unlocks LLM Jailbreaking

Sugar-Coated Poison: Benign Generation Unlocks LLM Jailbreaking (arxiv.org)

42 points by favoboa 1 year ago | 37 comments

Screenshot of arxiv.org: TPDE: A Fast Adaptable Compiler Back-End Framework

TPDE: A Fast Adaptable Compiler Back-End Framework (arxiv.org)

43 points by npalli 1 year ago | 12 comments

Screenshot of arxiv.org: Llemma: An Open Language Model for Mathematics

Llemma: An Open Language Model for Mathematics (arxiv.org)

239 points by AlphaWeaver 3 years ago | 43 comments