Network profile

John Smith

Reputation

Top tag

complexity-theory

Next privilege

75 Rep.

Set bounties

Badges

Newest

Student

Next badge

0/1

Impact

0 posts edited

0 helpful flags

0 votes cast

Questions (3)

Votes Activity Newest

3	Are problems in NP decidable in polynomial time by NDTMs, or just recognisable?
2	Inserting at the head of a linked list is O(1), but this involves moving pointers, and they are not constant size
2	Why is a pointer constant space?

Reputation (71)

This user has no recent positive reputation changes

Answers (0)

Votes Activity Newest

This user has not answered any questions

Tags (4)

0 complexity-theory × 3	0 runtime-analysis
0 time-complexity	0 space-complexity

Bookmarks (0)

Votes Activity Newest Views Added

This user has no bookmarked questions.

Accounts (2)

	Computer Science	71 rep	1 bronze badge
	Mathematics	33 rep	6 bronze badges

Badge (1)

Recent Class Name

Student

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (0)

This user has not cast any votes

User feed

Stack Exchange Network

current community

your communities

more stack exchange communities