User Super0 - Theoretical Computer Science Stack Exchange

Super0

Unregistered

Member for 8 years, 8 months
Last seen more than 8 years ago

8 Answers

Score Activity Newest

8 votes

NP-hard problems on paths

graph-theory np-hardness

answered Feb 4, 2014 at 14:49

2 votes

Complexity of topological sort with constrained positions

sorting directed-acyclic-graph partial-order order-theory topological-sorting

answered Sep 19, 2013 at 13:56

2 votes

Proof for ACYCLIC PARTITION being NP-complete

graph-theory approximation-algorithms np-complete

answered Mar 1, 2014 at 11:28

2 votes

Is there a non Turing-complete model of computation whose halting problem is undecidable?

automata-theory computability turing-machines lambda-calculus universal-computation

answered Mar 28, 2014 at 0:07

1 vote

Turing-complete computation models on graphs

reference-request graph-theory graph-algorithms computability

answered Mar 28, 2014 at 18:44

1 vote

Maximum matching versus preferential assignment

multicommodity-flow

answered Apr 16, 2014 at 19:51

0 votes

Complexity of ambiguous parsing?

string-matching

answered Apr 2, 2014 at 18:50

-2 votes

Algorithms from the Book.

ds.algorithms soft-question ds.data-structures big-list

answered Feb 26, 2014 at 15:02