Algorithmic complexity of a graph
From: caterina (caterina.mora_at_uibk.ac.at)
Date: 10/06/04
- Next message: Fred the Wonder Worm: "Re: a combinatorics proof needed"
- Previous message: Martin Rubey: "Solving overdetermined equations"
- Next in thread: Felix Goldberg: "Re: Algorithmic complexity of a graph"
- Reply: Felix Goldberg: "Re: Algorithmic complexity of a graph"
- Messages sorted by: [ date ] [ thread ]
Date: 6 Oct 04 06:40:33 -0400 (EDT)
Hi!
I don't know if this is the right place to ask this question, but I
have no other ideas...
Does by chance anyone know of a definition of the ALGORITHMIC (or
Kolmogorov) complexity of a graph? And, in case, could you suggest
where I could look for it?
I have only found definitions of computational complexity...
Thanks a lot!!!
cat
- Next message: Fred the Wonder Worm: "Re: a combinatorics proof needed"
- Previous message: Martin Rubey: "Solving overdetermined equations"
- Next in thread: Felix Goldberg: "Re: Algorithmic complexity of a graph"
- Reply: Felix Goldberg: "Re: Algorithmic complexity of a graph"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|