Network profile

Lazer

Reputation

1,007

1k
837
667

2018
2019
2020
2021

Top tag

np-complete

Next privilege

2,000 Rep.

Edit questions and answers

Badges

2

10

8

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

5 votes cast

Questions (3)

Votes Activity Newest

48	Is a push-down automaton with two stacks equivalent to a turing machine?
34	How can I verify a solution to Travelling Salesman Problem in polynomial time?
8	Is it intuitive to see that finding a Hamiltonian path is not in P while finding Euler path is?

Reputation (1,007)

+340	How can I verify a solution to Travelling Salesman Problem in polynomial time?
+480	Is a push-down automaton with two stacks equivalent to a turing machine?
+80	Is it intuitive to see that finding a Hamiltonian path is not in P while finding Euler path is?

Answers (0)

Votes Activity Newest

This user has not answered any questions

Tags (9)

0 np-complete × 2	0 graphs
0 complexity-theory × 2	0 traveling-salesman
0 computability	0 intuition
0 turing-machines	0 automata
0 pushdown-automata

Bookmarks (2)

Votes Activity Newest Views Added

63	Distributed vs parallel computing
59	Knapsack problem — NP-complete despite dynamic programming solution?

Accounts (39)

	Stack Overflow	77,303 rep	106 gold badges261 silver badges346 bronze badges
	Unix & Linux	30,229 rep	21 gold badges65 silver badges74 bronze badges
	Super User	15,047 rep	39 gold badges108 silver badges138 bronze badges
	Photography	3,829 rep	6 gold badges33 silver badges44 bronze badges
	Meta Stack Exchange	3,437 rep	2 gold badges22 silver badges22 bronze badges

Badges (9)

Recent Class Name

Yearling × 5	Nice Question × 2
Notable Question × 3	Scholar
Good Question × 2	Student
Famous Question × 2	Supporter
Popular Question × 3

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (5)

all time			by type
5	up		2	question
0	down		3	answer

Computer Science Stack Exchange works best with JavaScript enabled