Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs

Stasys Jukna. Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. Inf. Process. Lett., 69(6):267-269, 1999. [doi]

Abstract

Abstract is missing.