Theoretical Computer Science
user avatar
user avatar
user avatar
Yuval Filmus
  • Member for 12 years
  • Last seen more than a week ago
Profile Activity
Stats
14,120
reputation
144k
reached
156
answers
10
questions
Communities
View all
About

Associate Professor at the Henry and Marilyn Taub Department of Computer Science at the Technion – Israel Institute of Technology.

Badges
View all badges
1
gold badge
43
silver badges
88
bronze badges
Top tags
View all tags
398
Score
47
Posts
28
Posts %
170
Score
21
Posts
13
Posts %
143
Score
27
Posts
16
Posts %
130
Score
18
Posts
11
Posts %
122
Score
19
Posts
11
Posts %
117
Score
15
Posts
9
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
32
Is $AC^0/poly \cap NP$ contained in $P$?
Oct 6, 2010
answer
30
Representing OR with polynomials
Feb 21, 2014
answer
29
Reasons for which a graph may be not $k$ colorable?
Nov 25, 2012
question
27
Coloring complexity of graphs
Jul 20, 2012
question
24
Balls and Bins analysis in the $m \gg n$ regime: gaps
Nov 29, 2012
answer
20
The cozy neighborhoods of "P" and of "NP-hard"
Dec 23, 2012
answer
19
Graph theoretic restriction to Proofs in Proof Complexity Theory
Jan 18, 2015
answer
19
A special class of languages: “circular” languages. Is it known?
Jan 12, 2011
answer
19
Are all the functions whose fourier weight is concentrated on the small sized sets computed by AC0 circuits?
Sep 29, 2012
answer
18
Who introduced the complexity class AC?
Sep 21, 2012
Top network posts
View all network posts
246
Why is writing down mathematical proofs more fault-proof than writing computer code?
146
What's the best way to write e-mail addresses?
142
Identification of a curious function
87
Keeping a String Secret in (Open) Source Code
77
Can a computer determine whether a mathematical statement is true or not?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.