Algorithmic Cross-Complexity and Relative Complexity

Daniele Cerra, Mihai Datcu. Algorithmic Cross-Complexity and Relative Complexity. In James A. Storer, Michael W. Marcellin, editors, 2009 Data Compression Conference (DCC 2009), 16-18 March 2009, Snowbird, UT, USA. pages 342-351, IEEE Computer Society, 2009. [doi]

@inproceedings{CerraD09,
  title = {Algorithmic Cross-Complexity and Relative Complexity},
  author = {Daniele Cerra and Mihai Datcu},
  year = {2009},
  doi = {10.1109/DCC.2009.6},
  url = {http://dx.doi.org/10.1109/DCC.2009.6},
  researchr = {https://researchr.org/publication/CerraD09},
  cites = {0},
  citedby = {0},
  pages = {342-351},
  booktitle = {2009 Data Compression Conference (DCC 2009), 16-18 March 2009, Snowbird, UT, USA},
  editor = {James A. Storer and Michael W. Marcellin},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3592-0},
}