William Slofstra

According to our database, William Slofstra authored at least 10 papers between 2007 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

The NPA hierarchy does not always attain the commuting operator value.

Marco Fanizza, Larissa Kroell, Arthur Mehta, Connor Paddock, Denis Rochette, William Slofstra, Yuming Zhao

CoRR, October, 2025

2024

Two Prover Perfect Zero Knowledge for MIP.

Kieran Mastel, William Slofstra

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2021

The membership problem for constant-sized quantum correlations is undecidable.

Honghao Fu, Carl A. Miller, William Slofstra

CoRR, 2021

2019

Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs.

Alex Bredariol Grilo, William Slofstra, Henry Yuen

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Complexity Lower Bounds for Computing the Approximately-Commuting Operator Value of Non-Local Games to High Precision.

Matthew Coudron, William Slofstra

Proceedings of the 34th Computational Complexity Conference, 2019

2018

Smooth Schubert varieties in the affine flag variety of type Ã.

Edward Richmond, William Slofstra

Eur. J. Comb., 2018

Parabolic Double Cosets in Coxeter Groups.

Sara C. Billey, Matjaz Konvalinka, T. Kyle Petersen, William Slofstra, Bridget Eileen Tenner

Electron. J. Comb., 2018

2017

Staircase diagrams and enumeration of smooth Schubert varieties.

Edward Richmond, William Slofstra

J. Comb. Theory A, 2017

2010

Annular embeddings of permutations for arbitrary genus.

Ian P. Goulden, William Slofstra

J. Comb. Theory A, 2010

2007

Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems.

Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay

Proceedings of the 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 2007