Abstract
Because of the slow progress in proving lower bounds on the circuit complexity of Boolean functions one is interested in restricted models of Boolean circuits like depth restricted circuits, decision trees, branching programs, width-k branching programs and k-times-only branching programs. We prove here exponentiallower bounds on the decision tree complexity of clique functions. For one-time-only branching programs we prove for k-clique functions large polynomial lower bounds if k is fixed and exponential lower bounds for k increasing with n. Finally we introduce the hierarchy of the classes BPk (P) of all sequences of Boolean functions which may be computed by k-times-only branching programs of polynomial size. We show constructively that BP1(P) is a proper subset of BP2(P).
Supported in part by DFG-grants No. We 1066/1–2 and Me 872/1-1
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ajtai,M./Babai,L./Hajnal,P./Komlós,M./Pudlák,P./Rödl,V./Szemerédi,E./Turán,G.: Two lower bounds for branching programs, 18. STOC, 30–38, 1986
Barrington,D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, 18.STOC,1–5, 1986
Borodin,A./Dolev,D./Fich,F.E./Paul,W.: Bounds for width two branching programs, 15.STOC, 87–93, 1983
Chandra,A.K./Furst,M.L./Lipton,R.J.: Multiparty protocols, 15.STOC, 94–99, 1983
Dunne, P.: Lower bounds on the complexity of 1-time only branching programs, FCT, LNCS 199, 90–99, 1985
Erdös,P./Kleitman,D.J./Rothschild,B.L.: Asymptotic enumeration of Kn-free graphs. Colloq.Intern.sulle Teorie Comb.,Accad.Naz. Lincei, Rome, 19–27, 1976
Kriegel,K./Waack,S.: Lower bounds on the complexity of real-time branching programs, Techn.Rep.,Akad.d.Wiss.Berlin (GDR), 1986
Masek,W.: A fast algorithm for the string editing problem and decision graph complexity, M.Sc. Thesis,MIT, 1976
Nechiporuk, E.I.: A Boolean function, Sov.Math.Dokl. 7, 999–1000, 1966
Pudlák, P.: A lower bound on complexity of branching programs, 11.MFCS,LNCS 176, 480–489, 1984
Pudlák,P./Zák,S.: Space complexity of computations, Preprint, Univ. Prague, 1983
Wegener, I.: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions, Information and Control 62, 129–143, 1984
Wegener,I.: On the complexity of branching programs and decision trees for clique functions, Techn.Rep.,Univ.Frankfurt a.M., 1984
Wegener, I.: Time-space trade-offs for branching programs, Journal of Computer and System Sciences 32, 91–96, 1986
Yao, A.C.: Lower bounds by probabilistic arguments,24.FOCS, 420–428, 1983
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wegener, I. (1987). On the complexity of branching programs and decision trees for clique functions. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds) TAPSOFT '87. CAAP 1987. Lecture Notes in Computer Science, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17660-8_43
Download citation
DOI: https://doi.org/10.1007/3-540-17660-8_43
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17660-2
Online ISBN: 978-3-540-47746-4
eBook Packages: Springer Book Archive