Profile Activity

Avi Tal

Network profile

Reputation

751

751
626
501

Mar
Jun
Sep
Dec

Top tag

cc.complexity-theory

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

1

2

8

Newest

Nice Answer

Next badge

45/600

Impact

0 posts edited

0 helpful flags

65 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Answers (8)

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)$
4	Implications of unprovability of $P\neq NP$
4	Sum From A List Of Numbers (Algorithm)
3	Why $PSPACE!=Dtime(2^n)$?

View more →

Reputation (751)

+40	Implications of unprovability of $P\neq NP$
+10	Is the decidability of a language decidable?
+40	Sum From A List Of Numbers (Algorithm)
+10	Most important new papers in computational complexity

View more →

Questions (5)

Votes Activity Newest

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

Tags (25)

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

View more →

Accounts (8)

	Theoretical Computer Science	751 rep	1 gold badge2 silver badges8 bronze badges
	Computer Science	131 rep	3 bronze badges
	Stack Overflow	121 rep	2 bronze badges
	Physics	101 rep
	Philosophy	101 rep

Badges (11)

Recent Class Name

Nice Answer	Commentator
Curious	Enthusiast
Yearling	Teacher
Fanatic	Supporter
Critic	Editor

View more →

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (65)

all time			by type			month
64	up		45	question		1
1	down		20	answer		1

Theoretical Computer Science Stack Exchange works best with JavaScript enabled