Network profile

Denis

Reputation

6,695

6.7k
5.7k
4.8k

2018
2019
2020
2021

Top tag

automata-theory

Next privilege

10,000 Rep.

Access moderator tools

Badges

Newest

Revival

Next badge

0/1

Impact

3 posts edited

0 helpful flags

229 votes cast

15 Questions

Votes Activity Newest Views

votes

answers

views

Problems with big open complexity gaps

Oct 17 '15 at 4:48 Community♦ 1

votes

answers

views

Consequences of NP=PSPACE

cc.complexity-theory complexity-classes conditional-results

Feb 14 '14 at 20:20 Alex Grilo 534

votes

answers

views

Nontrivial membership in NP

reductions np

Feb 20 '14 at 5:19 Kaveh 21k

votes

answers

views

EXPSPACE-complete problems

cc.complexity-theory reference-request big-list

Nov 7 '17 at 14:24 Denis 6,695

votes

answers

314

views

Intermediate problems between PSPACE and EXPTIME

cc.complexity-theory complexity-classes exp-time-algorithms pspace

Jun 9 '17 at 13:50 Denis 6,695

votes

answers

828

views

Büchi automata with acceptance strategy

fl.formal-languages automata-theory regular-language nondeterminism omega-language

Nov 2 at 11:52 Denis 6,695

votes

answer

views

Distance between regular languages

reference-request fl.formal-languages regular-language

Jun 3 '13 at 13:58 Neel Krishnaswami 30.3k

votes

answers

737

views

Implementation of surreal numbers for games

reference-request gt.game-theory implementation board-games combinatorial-game-theory

Apr 4 '19 at 23:55 Matt 21

votes

answer

270

views

Directed multigraphs as minimal automata

graph-theory automata-theory

Oct 9 '15 at 11:05 Klaus Draeger 2,470

votes

answers

245

views

Understanding graph minor theorem

reference-request graph-theory graph-minor

Dec 2 '14 at 20:05 Hermann Gruber 5,039

votes

answer

187

views

On bandwidth of graphs

reference-request graph-theory graph-algorithms gt.game-theory

May 31 '16 at 17:59 jayesh 21

votes

answers

237

views

Solving problems by deciding a logic

lo.logic reductions decidability

Jul 16 '14 at 12:10 joro 1,925

votes

answers

492

views

graph isomorphism given a partial isomorphism

graph-isomorphism

Apr 5 '14 at 19:54 David Monniaux 912

votes

answers

107

views

PSPACE-complete under NP reduction

cc.complexity-theory pspace

Feb 11 at 10:12 Denis 6,695

votes

answers

views

Advances in complexity by studying particular problems

cc.complexity-theory complexity-classes ho.history-overview

Oct 28 '15 at 13:28 Denis 6,695

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

15 Questions

Problems with big open complexity gaps

Consequences of NP=PSPACE

Nontrivial membership in NP

EXPSPACE-complete problems

Intermediate problems between PSPACE and EXPTIME

Büchi automata with acceptance strategy

Distance between regular languages

Implementation of surreal numbers for games

Directed multigraphs as minimal automata

Understanding graph minor theorem

On bandwidth of graphs

Solving problems by deciding a logic

graph isomorphism given a partial isomorphism

PSPACE-complete under NP reduction

Advances in complexity by studying particular problems