Network profile

Nikos M.

Reputation

561

563
533
503

2018
2019
2020
2021

Top tag

cc.complexity-theory

Next privilege

1,000 Rep.

See votes

Badges

2

9

Newest

Nice Answer

Next badge

13/100

Impact

0 posts edited

0 helpful flags

159 votes cast

11 Bookmarks

Votes Activity Newest Views Added

63

votes

14

answers

14k

views

Applications of topology to computer science

reference-request ho.history-overview topology survey

Nov 15 '15 at 9:31 Richard Cox 119

38

votes

9

answers

3k

views

Optimal greedy algorithms for NP-hard problems

cc.complexity-theory lower-bounds approximation-algorithms greedy-algorithms approximation-hardness

Dec 17 '15 at 16:11 Community♦ 1

29

votes

1

answer

3k

views

Halting problem, uncomputable sets: common mathematical proof?

computability halting-problem

Mar 11 '12 at 14:49 Neel Krishnaswami 30.2k

22

votes

4

answers

3k

views

Papers on relation between computational complexity and algebraic geometry/topology?

cc.complexity-theory reference-request gct algebraic-topology

Apr 29 '18 at 1:08 Community♦ 1

19

votes

4

answers

2k

views

Chaos and the $P{=}NP$ question

cc.complexity-theory p-vs-np

Dec 9 '17 at 11:42 Mohammad Al-Turkistany 20.1k

19

votes

5

answers

2k

views

(False?) proof for computability of a function?

computability

Sep 2 '15 at 18:12 Nikos M. 561

17

votes

1

answer

515

views

Fooling arbitrary symmetric functions

cc.complexity-theory derandomization space-bounded pseudorandomness

Feb 17 '11 at 19:01 Kaveh 21k

15

votes

4

answers

678

views

Program reasoning about own source code

pl.programming-languages ai.artificial-intel recursion

Jan 17 '16 at 14:38 Community♦ 1

15

votes

6

answers

3k

views

Is there a formal proof that quantum computing is or will be faster than classical computing?

quantum-computing

Jul 26 '14 at 17:48 Community♦ 1

13

votes

2

answers

415

views

What is an equivalent definition of mP/poly in terms of a Turing machine?

cc.complexity-theory complexity-classes circuit-complexity polynomial-time monotone

Feb 3 '17 at 8:52 Jan Johannsen 4,479

9

votes

2

answers

8k

views

Why is non-determinism (Push-down automata) necessary?

fl.formal-languages automata-theory context-free

Dec 25 '15 at 6:50 Sushant Shinde 11

Theoretical Computer Science Stack Exchange works best with JavaScript enabled