Aaron Rotenberg's user avatar
Aaron Rotenberg's user avatar
Aaron Rotenberg's user avatar
Aaron Rotenberg
  • Member for 10 years, 4 months
  • Last seen more than a month ago
9 votes
1 answer
934 views

How hard is finding the shortest path in a graph matching a given regular language?

8 votes
3 answers
529 views

Isn't polynomial identity testing over arithmetic *expressions* trivial?

6 votes
0 answers
338 views

What is the state of the algorithmic art for floating point arithmetic on complex numbers?

5 votes
1 answer
97 views

Is there a model of ZF¬C where some program always terminates but has no loop variant?

4 votes
0 answers
93 views

Is there a name for the class of functions whose totality can be proved using "Ackermann-like" reasoning?

2 votes
1 answer
84 views

What is the time complexity of determining whether a solution $x$ exists to $x^k \equiv c \pmod{N}$ if we know the factorization of $N$?

2 votes
0 answers
37 views

Given a vertex in a digraph, is there a standard term for (the vertices reachable from it) union (the vertices reaching it)?

2 votes
1 answer
139 views

Characterizing cycles in a directed graph with optional edges