Skip to main content
Theoretical Computer Science
Arnaud Casteigts's user avatar
Arnaud Casteigts's user avatar
Arnaud Casteigts's user avatar
Arnaud Casteigts
  • Member for 11 years, 4 months
  • Last seen this week
Profile Activity
Stats
378
reputation
4k
reached
2
answers
4
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
1
silver badge
10
bronze badges
Top tags
View all tags
2
Score
2
Posts
33
Posts %
2
Score
1
Posts
17
Posts %
2
Score
1
Posts
17
Posts %
2
Score
1
Posts
17
Posts %
2
Score
1
Posts
17
Posts %
0
Score
3
Posts
50
Posts %
Top posts
question
10
Computing the edge orbits of a graph (and discussing definitions)
Oct 20, 2019
question
8
Complexity of graph isomorphism with properly colored edges (ref. request)
Dec 18, 2019
answer
2
Why bother with deterministic Turing machines when nondeterministic Turing machines consume less space and time?
Sep 18, 2017
answer
2
Sequential vs Distributed algo question
Feb 3, 2020
question
1
Balanced set coloring
Nov 17, 2023
question
1
Nondeterministic Turing Machines as deciders, versus NP and co-NP
Feb 16
Top network posts
View all network posts
9
Does a strong digraph always admit a vertex that lies on some path between $\Theta(n^2)$ pairs of vertices?
5
Does a strong digraph always admit a vertex that lies on some path between $\Theta(n^2)$ pairs of vertices?