Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Koiran:1994:CRA,
author = "P. Koiran",
title = "Computing over the reals with addition and order
(complexity theory)",
journal = j-THEOR-COMP-SCI,
volume = "133",
number = "1",
pages = "35--47",
day = "11",
month = oct,
year = "1994",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:18:27 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1994&volume=133&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1994&volume=133&issue=1&aid=1704",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
conflocation = "Barcelona, Spain; 4-6 Oct. 1993",
conftitle = "Workshop on Continuous Algorithms and Complexity",
corpsource = "Lab. de l'Inf. du Parallelisme, Ecole Normale
Sup{\'e}rieure de Lyon, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "additive real machines; Boolean functions; complexity
theory; computational complexity; digital
nondeterminism; model of computation; real Turing
machine; recognizable Boolean languages; Turing
machines",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}