On the nonapproximability of boolean functions by OBDDs and read-k-times branching programs

Information and Computation

Volumn 178, Issue 1, 2002, Pages 263-278

  Bollig, Beate ^a   Sauerhoff, Martin ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Approximations; Binary decision diagrams; Branching programs; Computational complexity; Lower bounds

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; THEOREM PROVING;

BRANCHING PROGRAMS; HANKEL MATRICES; NONAPPROXIMABILITY; ORDERED BINARY DECISION DIAGRAMS; UNIFORM DISTRIBUTION;

BOOLEAN FUNCTIONS;

EID: 0037057840     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93174-3     Document Type: Article

References (24)

1. Ajtai, M. (1999), Determinism versus non-determinism for linear time RAMs with memory restrictions, in "Proc. of 31st STOC," pp. 632-641.
2. Ajtai, M. (1999), A non-linear time lower bound for boolean branching programs, in "Proc. of 40th FOCS," pp. 60-70.
3. Alon, N., and Maass, W. (1998), Meanders and their applications in lower bounds arguments, J. Comput. System Sci. 37, 118-129.
4. Babai, L., Frankl, P., and Simon, J. (1986), Complexity classes in communication complexity theory, in "Proc. of 27th FOCS," pp. 337-347.
5. Babai, L., Hayes, T. P., and Kimmel, P. G. (1998), The cost of the missing bit: Communication complexity with help, in "Proc. of 30th STOC," pp. 673-682.
6. Beame, P., Jayram, T. S., and Saks, M. (2001), Time-space tradeoffs for branching programs, J. Comput. System Sci. 63, 542-572.
7. Beame, P., Saks, M., Sun, X., and Vee, E. (2000), Super-linear time-space tradeoff lower bounds for randomized computation, in "Proc. of 41st FOCS," pp. 169-179.
8. Beame, P., and Vee, E. (2002), Time-space tradeoffs, multiparty communication complexity, and nearest neighbor problems, in "Proc. of 34th STOC," pp. 688-697.
9. Borodin, A., Razborov, A. A., and Smolensky, R. (1993), On lower bounds for read-k-times branching programs, Comput. Complexity 3, 1-18.
10. Droste, S., Heutelbeck, D., and Wegener, I. (2000), Distributed hybrid genetic programming for learning boolean functions, in "Proc. of PPSN 'VI (Parallel Problem Solving from Nature)," Lecture Notes in Computer Science, Vol. 1917, pp. 181-190, Springer-Verlag, Berlin.
11. Hromkoviĉ, J. (1997), "Communication Complexity and Parallel Computing," EATCS Texts in Theoretical Computer Science, Springer-Verlag, Berlin.
12. Jukna, S. P. (1987), Lower bounds on communication complexity, Math. Logic Appl. 5, 22-30.
13. Krause, M. (1991), Lower bounds for depth-restricted branching programs, Inform. and Comput. 91, 1-14.
14. Krause, M. (1992), Separating ⊕-L from L, NL, co-NL and AL (=P) for oblivious Turing machines of linear access time, RAIRO Theor. Inform. Appl. 26, 507-522.
15. Krause, M., Savický, P., and Wegener, I. (1999), Approximations by OBDDs and the variable ordering problem, in "Proc. of 26th ICALP," Lecture Notes in Computer Science, Vol. 1644, pp. 493-502, Springer-Verlag, Berlin.
16. Kremer, I., Nisan, N., and Ron, D. (1999), On randomized one-round communication complexity, Comput. Complexity 8(1), 21-49.
17. Kushilevitz, E., and Nisan, N. (1997), "Communication Complexity," Cambridge University Press, Cambridge, UK.
18. Okol'nishnikova, E. A. (1993), On lower bounds for branching programs, Siberian Advances in Math. 3(1), 152-166.
19. Sauerhoff, M. (1998), Lower bounds for randomized read-k-times branching programs, in "Proc. of 15th STACS," Lecture Notes in Computer Science, Vol. 1373, pp. 105-115, Springer-Verlag, Berlin.
20. Sauerhoff, M. (2001), On the size of randomized OBDDs and read-once branching programs for k-stable functions, Comput. Complexity 10, 155-178.
21. Sauerhoff, M. (2000), "Approximation of Boolean Functions by Combinatorial Rectangles," Technical Report 58, Electr Coll. on Comp. Compl. Theor. Comput. Sci., to appear.
22. Sieling, D. (1994), "Algorithmen und Untere Schranken für Verallgemeinerte OBDDs," Ph.D. thesis, Univ. Dortmund Shaker-Verlag. [In German]
23. Wegener, I. (2000), "Branching Programs and Binary Decision Diagrams-Theory and Applications," Monographs on Discrete and Applied Mathematics. SIAM, Philadelphia, PA.
24. Yao, A. C. (1983), Lower bounds by probabilistic arguments, in "Proc. of 24th FOCS," pp. 420-428.