Lower bounds on the complexity of real-time branching programs
RAIRO-Theor. Inf. Appl., 22 4 (1988) 447-459
Published online: 01 February 2017
We offer the option to send directly this article to your Kindle device as a PDF. To allow us to send documents to your Kindle, you must add firstname.lastname@example.org to the list of approved contacts in your Amazon's Kindle account (see Amazon help page).
Please select either @kindle.com or @free.kindle.com address to send the PDF as a Kindle Personal Document. Note that using @kindle.com will allow direct syncing to your device but may imply a fee. @free.kindle.com may take longer, using USB or wi-fi, but with no fee.