On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them

Александр Викторович Чашкин · Discrete Mathematics and Applications · 1994

Article On the complexity of Boolean matrices, graphs, and the Boolean functions corresponding to them was published on January 1, 1994 in the journal Discrete Mathematics and Applications (volume 4, issue 3).

Read the paper · More papers on PaperTik