Abstract
In this chapter we show a time-size tradeoff for nondeterministic branching programs. By the size of a program in this chapter we will mean the number of nodes, not just the number of labeled edges. A program computes a given function in time T if every accepted input has at least one accepting computation of length at most T.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2012). Bounded Time. In: Boolean Function Complexity. Algorithms and Combinatorics, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24508-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-24508-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24507-7
Online ISBN: 978-3-642-24508-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)