2 citations · 2 across the 8 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023
Refuting approaches to the log-rank conjecture for XOR functions
Hamed Hatami, Kaave Hosseini, Shachar Lovett +1
The log-rank conjecture, a longstanding problem in communication complexity, has persistently eluded resolution for decades. Consequently, some recent efforts have focused on poten…
cs.DS2023★ 2 cited
A tight lower bound on non-adaptive group testing estimation
Nader H. Bshouty, Tsun-Ming Cheung, Gergely Harcos +2
Efficiently counting or detecting defective items is a crucial task in various fields ranging from biological testing to quality control to streaming algorithms. The \emph{group te…