Complexity Reference: compref2 (BibTex)

Authors: Aaderaa,SO B”rger,E

Year: 1981

Title: The equivalence of Horn and network complexity of Boolean functions

Journal: Acta Informatica, 15, 303-307

Comments: Shows that horn and network complexity are polynomially related.

Keywords: MATHS, COMPUTATIONAL, COMPLEXITY,

| Top | Authors | Journals | Years | Keywords | Search | New | Comments |


Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University