%0 Journal Article %1 journals/corr/Borassi16 %A Borassi, Michele %D 2016 %J CoRR %K dblp %T A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph. %U http://dblp.uni-trier.de/db/journals/corr/corr1602.html#Borassi16 %V abs/1602.02129

@article{journals/corr/Borassi16, added-at = {2018-08-13T00:00:00.000+0200}, author = {Borassi, Michele}, biburl = {https://www.bibsonomy.org/bibtex/2497c3ba9e7362a5650fce0f18fb53971/dblp}, ee = {http://arxiv.org/abs/1602.02129}, interhash = {e5d64cc1807ed30052712d47bd977ae4}, intrahash = {497c3ba9e7362a5650fce0f18fb53971}, journal = {CoRR}, keywords = {dblp}, timestamp = {2018-08-14T14:53:27.000+0200}, title = {A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph.}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1602.html#Borassi16}, volume = {abs/1602.02129}, year = 2016 }