Profile Activity

Avi Tal

Network profile

Reputation

799

801
656
511

Apr
Jul
Oct
Jan

Top tag

cc.complexity-theory

Next privilege

1,000 Rep.

See votes

Badges

1

3

8

Newest

Necromancer

Next badge

48/600

Impact

0 posts edited

0 helpful flags

68 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Answers (9)

Votes Activity Newest

20	Most important new papers in computational complexity
7	Conesequences of $\forall k\in \mathbb N \space NP\not\subseteq TISP(poly(n),n^k)$
5	Implications of unprovability of $P\neq NP$
4	Sum From A List Of Numbers (Algorithm)
3	Why $PSPACE!=Dtime(2^n)$?

View more →

Reputation (799)

+58	Implications of unprovability of $P\neq NP$
+20	Examples of the value of proofs for algorithms
+10	Indications that strengthen the conjecture: NEXP ⊊ EXP^NP
+10	Is the decidability of a language decidable?

View more →

Questions (5)

Votes Activity Newest

9	Relatively low ambitious frontiers
6	Indications that strengthen the conjecture: NEXP ⊊ EXP^NP
6	Algorithm for identifying unprovable statements
5	Are there languages in $DTIME(2^{t(n)})$ that are not in $NTIME(t(n))$?
1	QPIP minimal client quantum capabilities

Tags (26)

18 cc.complexity-theory × 6	5 np-hardness
7 complexity-classes × 3	5 p-vs-np
7 proofs × 2	5 big-picture
7 space-time-tradeoff	4 optimization
7 lower-bounds	3 pspace

View more →

Accounts (9)

	Theoretical Computer Science	799 rep	1 gold badge3 silver badges8 bronze badges
	Computer Science	131 rep	3 bronze badges
	Stack Overflow	121 rep	2 bronze badges
	Mathematics	121 rep	1 bronze badge
	Physics	101 rep

Badges (12)

Recent Class Name

Necromancer	Critic
Nice Answer	Commentator
Curious	Enthusiast
Yearling	Teacher
Fanatic	Supporter

View more →

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (68)

all time			by type			month
67	up		48	question		2
1	down		20	answer		2

Theoretical Computer Science Stack Exchange works best with JavaScript enabled