Created by W.Langdon from gp-bibliography.bib Revision:1.7185
1. We show that OBDDs approximating the well-known hidden weighted bit function for uniformly distributed inputs with constant 1/4 error have size 2?(n ) , improving a previously known result.
2. We prove that for every variable order ? the approximation of some output bits of integer multiplication with constant error requires ?-OBDDs of exponential size.",
Genetic Programming entries for Andre Gronemeier