3 papers
cs.AI2025
FormulaOne: Measuring the Depth of Algorithmic Reasoning Beyond Competitive Programming
Gal Beniamini, Yuval Dor, Alon Vinnikov +10
Frontier AI models demonstrate formidable breadth of knowledge. But how close are they to true human -- or superhuman -- expertise? Genuine experts can tackle the hardest problems…
cs.AI2024
Artificial Expert Intelligence through PAC-reasoning
Shai Shalev-Shwartz, Amnon Shashua, Gal Beniamini +6
Artificial Expert Intelligence (AEI) seeks to transcend the limitations of both Artificial General Intelligence (AGI) and narrow AI by integrating domain-specific expertise with cr…
math.CO2024
The Rank-Ramsey Problem and the Log-Rank Conjecture
Gal Beniamini, Nati Linial, Adi Shraibman
A graph is called Rank-Ramsey if (i) Its clique number is small, and (ii) The adjacency matrix of its complement has small rank. We initiate a systematic study of such graphs. Our…