@InProceedings{ABA:95:ICALP,
  author =       "Amir M. Ben-Amram",
  year =         "1995",
  title =        "Lower Bounds on Algebraic Random Access Machines",
  booktitle =    "Proceedings, 22nd Int. Colloquium on Automata,
                 Languages and Programming (ICALP)",
  editor =       "Z. F{\"u}l{\"o}p and F. G\'ecseg",
  publisher =    "Springer",
  series =       "LNCS",
  volume =       "944",
  pages =        "360--371",
  keywords =     "lower bounds, algebraic random access machines,
                 real-number RAM, algebraic computation tree",
  summary =      "The method of proving lower bounds for decision
                 problems by topological component counting, previously
                 used with respect to algebraic computation trees, is
                 extended in this work to random access machines with
                 operations $\{+,-,\times,/\}$ or
                 $\{+,-,\times,\lfloor\;\rfloor\}$.",
  puf =          "Artikel i proceedings (med censur)",
}