Complexity Reference: compref1 (BibTex)

Authors: Aaderaa,SO B”rger,E

Year: 1979

Title: The Horn Complexity of Boolean functions and Cook's problem

Book Title: Proceedings of the 5th Scandanavian Logic Symposium

Editors: Mayoh,B Jensen,F

Publisher: Aalborg University Press, Aalborg, pages: 231-256

Comments: Horn complexity as the minimum length of a Horn formula for a function.

Keywords: LOGIC, COMPUTATIONAL, COMPLEXITY,

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


Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University