@singerng_

I do math about computers! || phd student @CSDatCMU: complexity, algorithms, crypto, combinatorics || @harvard '22 || he/him || #BlackLivesMatter

 Pittsburgh, PA
noahsinger.org
Joined September 2013
  • Tweets102
  • Following299
  • Followers339
17Media
Noah Singer retweeted
arXiv.org@arxivOct 1
arXiv has updated our policy on rate limiting for all submitters. This update was made to fairly distribute moderator time & support the arXiv community of staff, volunteers, readers & authors. Please read our announcement to learn more: blog.arxiv.org/2026/10/01/up…
arXiv logo in white over a whiteboard with math symbols.

ALT arXiv logo in white over a whiteboard with math symbols.

79
496
239
1,730
760,155
WOW!! Zeta(5) is irrational! Here's a Lean formalization: github.com/mo271/zeta5 Amazing what we'll learn (with AI help)

GitHub - mo271/Zeta5

Contribute to mo271/Zeta5 development by creating an account on GitHub.

github.com
23
91
17
497
74,743
[what I imagine the coordinator agent says to the subagents when I ask to it write a proof]
10
233
Outstanding progress towards the Unique Games Conjecture posted by Yumou Fei, Dor Minzer, and Shuo Wang: eccc.weizmann.ac.il/report/2… 👀
4
35
3
213
46,718
My recent column on some conjectural streaming lower bounds for approximating CSPs will appear in SIGACT News Open Problems Column! arxiv.org/abs/2510.10714

Nine lower bound conjectures on streaming approximation algorithms for CSPs

In this column, we overview recent progress by many authors on understanding the approximability of constraint satisfaction problems (CSPs) in low-space streaming models. Inspired by this recent...

arxiv.org
1
9
519
New w/ Meghal Gupta, William He, @BooleanAnalysis arxiv.org/abs/2508.09422 We give a quadratically faster classical algo for noisy planted kXOR (k > large const), dispelling (for now) claimed quartic speedup for quantum algos. 🧵 (1/10)

A Classical Quadratic Speedup for Planted $k$XOR

A recent work of Schmidhuber et al (QIP, SODA, & Phys. Rev. X 2025) exhibited a quantum algorithm for the noisy planted $k$XOR problem running quartically faster than all known classical...

arxiv.org
1
7
1
32
3,945
more replies
For (b), we take the now-standard step of forming “the Kikuchi graph” of G. This is an N=subexp(n)-size graph in which cycles essentially correspond to even covers. The punchline of our paper is …… (9/10)
1
1
291
that we can find length ~ log n Kikuchi cycles, and hence size ~ log n even covers, in O(√N) time. This uses classical ‘birthday bound’ methods from sublinear algorithms, based on taking ~ √N walks of length ~ log n and looking for collisions. (10/10)
1
282
Breakthrough by Fei-Minzer-Wang on what seemed a very, very hard problem! w/ Saxena-Sudan-@Santho_Velusamy, we gave logspace O(1)-pass algorithms to (1/2-ε)-approximate Max-Directed-Cut. FMW result implies: (1/2+ε)-approximation needs poly(n) passes. arxiv.org/abs/2503.23404
1
11
460
I made a Youtube version of my SODA 2025 talk on streaming algorithms for Max-Directed-Cut towards the 1/2 threshold, via local algorithms! w/ Raghuvansh Saxena, Madhu Sudan, @Santho_Velusamy, recorded from New Orleans ❤️ youtu.be/TQAC5Q49pzo

SODA 2025 Talk: Streaming algorithms via local algorithms for Maximum Directed Cut

Joint work with Raghuvansh Saxena, Madhu Sudan, and Santhoshini Vel...

youtube.com
2
7
1,911
my article (with some spanish language quotations) drawing parallels between some of Jorge Luis Borges' fiction and computational complexity theory, published ~2 years ago in Variaciones Borges, is now online on JSTOR! jstor.org/stable/27305845

Borges and the Aesthetics of Computation | JSTOR

Noah Gabriel Singer, Borges and the Aesthetics of Computation, Variaciones Borges, No. 56, 2023

jstor.org
3
16
1,936
"Latency Guarantees for Caching with Delayed Hits" w/ Keerthana Gurushankar & @b_subercaseaux was accepted @ INFOCOM'25. Started from a project in @justinesherry @NiravAtre 's networks class at @CSDatCMU ! tl;dr LRU is competitive even when inter-request time << storage latency
3
9
2,964
The journal version of my paper with M. Sudan and @Santho_Velusamy is out, "Streaming approximation resistance of every ordering CSP": link.springer.com/article/10… We prove: Ordering CSPs, like "Max-Acyclic-Subgraph", are *really* hard to apx w/ streaming algos.

Streaming approximation resistance of every ordering CSP

computational complexity - An ordering constraint satisfaction problem (OCSP) is defined by a family $$\mathcal F$$ of predicates mapping permutations on $$\{1,\ldots,k\}$$ to $$\{0,1\}$$ . An...

link.springer.com
17
755
Load more