Skip to main content
Theoretical Computer Science
Iddo Tzameret's user avatar
Iddo Tzameret's user avatar
Iddo Tzameret's user avatar
Iddo Tzameret
  • Member for 14 years, 4 months
  • Last seen more than a month ago
Profile Activity
Stats
1,919
reputation
122k
reached
15
answers
1
question
Communities
View all
About

Professor of computer science at Imperial College London. I'm interested in all areas pertaining to the theory of computing. Mainly computational complexity theory, and related areas. See here: https://www.doc.ic.ac.uk/~itzamere/

Badges
View all badges
1
gold badge
19
silver badges
28
bronze badges
Top tags
View all tags
120
Score
10
Posts
62
Posts %
43
Score
2
Posts
12
Posts %
39
Score
2
Posts
12
Posts %
35
Score
2
Posts
12
Posts %
34
Score
4
Posts
25
Posts %
33
Score
5
Posts
31
Posts %
Top posts
View all questions and answers
answer
42
Major unsolved problems in theoretical computer science?
Aug 19, 2010
answer
25
Does $VP \neq VNP$ imply $P \neq NP$?
Dec 22, 2010
answer
22
Well known classes of boolean formulas that require exponentially long resolution proofs
Aug 20, 2010
answer
22
Using lambda calculus to derive time complexity?
Aug 21, 2010
answer
21
Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)
Oct 5, 2010
question
16
Average-case tautologies/contradictions, beyond the random k-CNF model
Mar 2, 2011
answer
14
Formal representation of rings in computations
Oct 21, 2010
answer
13
Start learning proof complexity
Oct 10, 2013
answer
12
$\mathsf{NC^1}$ circuit evaluation
Oct 22, 2013
answer
12
Conditions for tractability of 3SAT-Satisfiability
Nov 19, 2010
Top Meta posts
1
3
49
What should our site/domain name be?
Top network posts
View all network posts
16
What are some deep theorems, and why are they considered deep?
6
Efficient approximation of a matrix and its inverse