Bandwidth Constraints on Problems Complete for Polynomial Time. Sudborough, I. H. Theor. Comput. Sci., 26:25-52, 1983.
Bandwidth Constraints on Problems Complete for Polynomial Time. [link]Link  Bandwidth Constraints on Problems Complete for Polynomial Time. [link]Paper  bibtex   
@article{journals/tcs/Sudborough83,
  added-at = {2011-09-07T00:00:00.000+0200},
  author = {Sudborough, Ivan Hal},
  biburl = {https://www.bibsonomy.org/bibtex/2947e6f654800b1803dbef3d63c87e5c2/dblp},
  ee = {http://dx.doi.org/10.1016/0304-3975(83)90078-6},
  interhash = {d43c9154a4e356b37e13982240fb3fa4},
  intrahash = {947e6f654800b1803dbef3d63c87e5c2},
  journal = {Theor. Comput. Sci.},
  keywords = {dblp},
  pages = {25-52},
  timestamp = {2011-09-08T11:34:21.000+0200},
  title = {Bandwidth Constraints on Problems Complete for Polynomial Time.},
  url = {http://dblp.uni-trier.de/db/journals/tcs/tcs26.html#Sudborough83},
  volume = 26,
  year = 1983
}

Downloads: 0