%0 Journal Article %1 journals/jsyml/AjtaiF90 %A Ajtai, Miklós %A Fagin, Ronald %D 1990 %J J. Symb. Log. %K dblp %N 1 %P 113-150 %T Reachability Is Harder for Directed than for Undirected Finite Graphs. %U http://dblp.uni-trier.de/db/journals/jsyml/jsyml55.html#AjtaiF90 %V 55

@article{journals/jsyml/AjtaiF90, added-at = {2014-08-05T00:00:00.000+0200}, author = {Ajtai, Miklós and Fagin, Ronald}, biburl = {https://www.bibsonomy.org/bibtex/2db3f005b61606f8ad61ef916ad115323/dblp}, ee = {http://projecteuclid.org/euclid.jsl/1183743189}, interhash = {8c5bd8a326201c6cb72dde6d21d78f3e}, intrahash = {db3f005b61606f8ad61ef916ad115323}, journal = {J. Symb. Log.}, keywords = {dblp}, number = 1, pages = {113-150}, timestamp = {2015-06-18T02:25:49.000+0200}, title = {Reachability Is Harder for Directed than for Undirected Finite Graphs.}, url = {http://dblp.uni-trier.de/db/journals/jsyml/jsyml55.html#AjtaiF90}, volume = 55, year = 1990 }