Network profile

STanja

Reputation

361

376
211
46

Dec
Mar
Jun
Sep

Top tag

algorithms

Next privilege

500 Rep.

Access review queues

Badges

2

5

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

14 votes cast

Answers (12)

Votes Activity Newest

3	Is there an NP-hard problem for which no Fixed-Parameter Tractable algorithm exists?
3	Does the product of two functions equal the product of their Big-O's?
3	Is this a Fixed Parameter Tractable algorithm?
3	PTAS vs. FPTAS input
2	Connection between vertex cover and P=NP

View more →

Reputation (361)

+30	Is there an NP-hard problem for which no Fixed-Parameter Tractable algorithm exists?
+10	PTAS vs. FPTAS input
+45	Does the product of two functions equal the product of their Big-O's?
+10	Is this a Fixed Parameter Tractable algorithm?

View more →

Questions (0)

Votes Activity Newest

This user has not asked any questions

Tags (21)

8 algorithms × 6	3 asymptotics
8 complexity-theory × 4	3 parameterized-complexity
6 time-complexity × 2	2 vertex-cover
5 np-hard × 2	2 computability
3 complexity-classes	2 turing-machines

View more →

Bookmarks (0)

Votes Activity Newest Views Added

This user has no bookmarked questions.

Accounts (3)

	Computer Science	361 rep	2 silver badges5 bronze badges
	Mathematics	143 rep	4 bronze badges
	Theoretical Computer Science	101 rep

Badges (7)

Recent Class Name

Yearling	Supporter
Commentator	Teacher
Critic	Editor
Enthusiast

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (14)

all time			by type			month
5	up		9	question		2
9	down		5	answer		2

Computer Science Stack Exchange works best with JavaScript enabled