◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Justin Holmgren

4 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author2

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.CC4

identity via Semantic Scholar / OpenAlex

activity
20202022
most citedCounterexamples to the Low-Degree Conjecture

8 citations · 8 across the 3 of their papers we have counts for

collaborators

4 papers

cs.CC2022

Parallel Repetition For All 3-Player Games Over Binary Alphabet

Uma Girish, Justin Holmgren, Kunal Mittal +2

We prove that for every 3-player game with binary questions and answers and value <1, the value of the n-fold parallel repetition of the game decays polynomially fast to 0. Tha…

cs.CC2021

Parallel Repetition for the GHZ Game: A Simpler Proof

Uma Girish, Justin Holmgren, Kunal Mittal +2

We give a new proof of the fact that the parallel repetition of the (3-player) GHZ game reduces the value of the game to zero polynomially quickly. That is, we show that the value…

cs.CC2020

A Parallel Repetition Theorem for the GHZ Game

Justin Holmgren, Ran Raz

We prove that parallel repetition of the (3-player) GHZ game reduces the value of the game polynomially fast to 0. That is, the value of the GHZ game repeated in parallel t times…

cs.CC2020★ 8 cited

Counterexamples to the Low-Degree Conjecture

Justin Holmgren, Alexander S. Wein

A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", whic…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.