Linear comparison complexity of the n-cube membership problem

Mirko Krivánek, Jaroslav Morávek. Linear comparison complexity of the n-cube membership problem. In Lothar Budach, editor, Fundamentals of Computation Theory, FCT 85, Cottbus, GDR, September 9-13, 1985. Volume 199 of Lecture Notes in Computer Science, pages 242-248, Springer, 1985.

@inproceedings{KrivanekM85a,
  title = {Linear comparison complexity of the n-cube membership problem},
  author = {Mirko Krivánek and Jaroslav Morávek},
  year = {1985},
  researchr = {https://researchr.org/publication/KrivanekM85a},
  cites = {0},
  citedby = {0},
  pages = {242-248},
  booktitle = {Fundamentals of Computation Theory, FCT  85, Cottbus, GDR, September 9-13, 1985},
  editor = {Lothar Budach},
  volume = {199},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-15689-5},
}