A Fast Algorithm for Renaming a Set of Clauses as a Horn Set

Mannila, Heikki; Mehlhorn, Kurt

doi:10.1016/0020-0190(85)90096-1

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Fast Algorithm for Renaming a Set of Clauses as a Horn Set

MPS-Authors

/persons/resource/persons44982

Mannila, Heikki
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn, Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Mannila, H., & Mehlhorn, K. (1985). A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. Information Processing Letters, 21(5), 269-272. doi:10.1016/0020-0190(85)90096-1.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AEE1-A

Abstract

There is no abstract available