672 citations
- Michael Walter2 profiles24 · h 30
- Ludovico Lami23 · h 29
- F. Speelman16 · h 13
- J. Helsen2 profiles16 · h 18
- R. Gerritsma5 profiles16 · h 16
- Florian Schreck4 profiles15 · h 14
- A. Safavi-Naini2 profiles14 · h 21
- Christian Majenz12 · h 20
- M. Ozols11 · h 21
- K. Schoutens2 profiles10 · h 37
- Bartosz Regula9 · h 27
- Christian Schaffner9 · h 31
- University of AmsterdamNL195 papers
- Centrum Wiskunde & InformaticaNL123 papers
- Institute for Theoretical Physics AmsterdamNL38 papers
- Institute of PhysicsPL26 papers
- Delft University of TechnologyNL25 papers
- QuTechNL21 papers
- University of CopenhagenDK21 papers
- Ruhr University BochumDE17 papers
- Leiden UniversityNL13 papers
- Stanford UniversityUS13 papers
- Massachusetts Institute of TechnologyUS12 papers
- University of Maryland, College ParkUS12 papers
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2022★ 2 cited
Lifting to Parity Decision Trees Via Stifling
Arkadev Chattopadhyay, Nikhil S. Mande, Swagato Sanyal +1
We show that the deterministic decision tree complexity of a (partial) function or relation lifts to the deterministic parity decision tree (PDT) size complexity of the compose…
cs.CC2016★ 5 cited
On the sum-of-squares degree of symmetric quadratic functions
Troy Lee, Anupam Prakash, Ronald de Wolf +1
We study how well functions over the boolean hypercube of the form can be approximated by sums of squares of low-degree polynomials, obtaining good bounds…
cs.CC2014★ 6 cited
Some upper and lower bounds on PSD-rank
Troy Lee, Zhaohui Wei, Ronald de Wolf
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic proper…