BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Jump to: Book Section
    Number of items: 2.

    Book Section

    Lachish, Oded and Raz, R. (2001) Explicit lower bound of 4.5n - o(n) for boolena circuits. In: Vitter, J.S. and Spirakis, P. and Yannakakis, M. (eds.) STOC '01: Proceedings of the thirty-third annual ACM symposium on Theory of computing. Association for Computing Machinery, pp. 399-408. ISBN 9781581133493.

    Wood, Peter (1995) Magic factoring of closure programs. In: Yannakakis, M. and Abiteboul, S. (eds.) Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. Association for Computing Machinery, pp. 174-183. ISBN 9780897917308.

    This list was generated on Tue Oct 19 19:26:18 2021 BST.