Network profile

Clement C.

Reputation

3,694

3.7k
2.2k
641

2017
2018
2019
2020

Top tag

boolean-functions

Next privilege

5,000 Rep.

Approve tag wiki edits

Badges

Newest

Announcer

Next badge

244/300

Impact

22 posts edited

43 helpful flags

244 votes cast

21 Questions

Votes Activity Newest Views

votes

answers

views

Generalizing the “median trick” to higher dimensions?

ds.algorithms randomized-algorithms

Sep 19 '15 at 3:40 Vitaly 881

votes

answers

644

views

Question about two matrices: Hadamard v. “the magical one” in the proof of the sensitivity conjecture

boolean-functions matrices boolean-matrix

Jul 9 at 4:23 J.G 471

votes

answer

636

views

Autoencoders and information compression

machine-learning it.information-theory

May 23 '18 at 16:23 Anirbit 614

votes

answers

599

views

Minimizing a monotone submodular function under a cardinality constraint

reference-request submodularity minimization

Jan 31 '16 at 21:52 Yuval Filmus 14k

votes

answers

575

views

Lower bound for testing closeness in $L_2$ norm?

ds.algorithms lower-bounds st.statistics property-testing

Jul 29 '13 at 21:23 Community♦ 1

votes

answers

553

views

Applications of Takens' theorem to TCS?

machine-learning lg.learning physics

Aug 24 at 2:08 Kalinda Vathupola 11

votes

answers

548

views

Lower bound on estimating $\sum_{k=1}^n a_k$ for non-increasing $(a_k)_k$

reference-request randomized-algorithms property-testing

Jan 1 '15 at 21:31 Community♦ 1

votes

answer

421

views

Deterministic error reduction, state-of-the-art?

reference-request randomness pseudorandomness expanders

Jun 18 '19 at 3:08 guest 96

votes

answer

415

views

Expected minimum influence of a random Boolean function $f\colon\{-1,1\}^n \to \{-1,1\}$

reference-request pr.probability boolean-functions

Mar 25 '16 at 22:18 Neal Young 5,607

votes

answer

339

views

Gap-Hamming with different “threshold” (i.e., not $n/2$)

communication-complexity

Jun 3 '17 at 17:36 Clement C. 3,694

votes

answers

312

views

Fourier spectrum of the parity of two monotone Boolean functions

boolean-functions fourier-analysis monotone

Mar 7 '17 at 20:35 Clement C. 3,694

votes

answer

243

views

Analogue of $k$-wise independence for other distributions than uniform

reference-request k-wise-independence

May 5 at 13:07 Community♦ 1

votes

answer

221

views

Minimizing a submodular function given noisy oracle access

reference-request optimization submodularity minimization

Nov 6 '16 at 19:42 Clement C. 3,694

votes

answers

220

views

One-way randomized complexity of (variants of) Gap-Hamming-Distance?

lower-bounds communication-complexity

Oct 17 '15 at 12:28 Clement C. 3,694

votes

answers

216

views

Testing sortedness of a normalized list of $n$ numbers

property-testing

Nov 18 '14 at 16:36 Juho 3,100

votes

answers

186

views

Generalization of Element Distinctness

reference-request property-testing

Jul 18 at 5:41 Clement C. 3,694

votes

answer

168

views

Optimal bounds for $k$-wise non-uniform random bits

reference-request randomness derandomization k-wise-independence

Mar 11 '19 at 21:56 Thomas 2,578

votes

answer

167

views

Newman's lemma for distributional communication complexity

randomness communication-complexity

Dec 16 '18 at 19:58 domotorp 12.9k

votes

answer

157

views

Separations between testing and tolerant testing for (natural) classes of functions?

reference-request lower-bounds property-testing

May 4 '18 at 18:00 Clement C. 3,694

votes

answer

149

views

Problems still “hard” in the SMP/Referee model with shared randomness?

reference-request communication-complexity

Mar 8 '16 at 15:15 Clement C. 3,694

votes

answer

views

Robustness to non-uniform randomness vs. one-sidedness

randomized-algorithms randomness property-testing

Apr 4 '19 at 20:15 D.W. 8,990

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

21 Questions

Generalizing the “median trick” to higher dimensions?

Question about two matrices: Hadamard v. “the magical one” in the proof of the sensitivity conjecture

Autoencoders and information compression

Minimizing a monotone submodular function under a cardinality constraint

Lower bound for testing closeness in $L_2$ norm?

Applications of Takens' theorem to TCS?

Lower bound on estimating $\sum_{k=1}^n a_k$ for non-increasing $(a_k)_k$

Deterministic error reduction, state-of-the-art?

Expected minimum influence of a random Boolean function $f\colon\{-1,1\}^n \to \{-1,1\}$

Gap-Hamming with different “threshold” (i.e., not $n/2$)

Fourier spectrum of the parity of two monotone Boolean functions

Analogue of $k$-wise independence for other distributions than uniform

Minimizing a submodular function given noisy oracle access

One-way randomized complexity of (variants of) Gap-Hamming-Distance?

Testing sortedness of a normalized list of $n$ numbers

Generalization of Element Distinctness

Optimal bounds for $k$-wise non-uniform random bits

Newman's lemma for distributional communication complexity

Separations between testing and tolerant testing for (natural) classes of functions?

Problems still “hard” in the SMP/Referee model with shared randomness?

Robustness to non-uniform randomness vs. one-sidedness