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

Local TagsRelease HistoryDetailsSummary

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

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AEE1-A Version Permalink: https://hdl.handle.net/21.11116/0000-000E-4862-3

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Mannila, Heikki¹, Author
Mehlhorn, Kurt¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Modified: 2006-08-09Date issued: 1985

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: Peer

Identifiers: eDoc: 344598
Other: Local-ID: C1256428004B93B8-10C573887897F861C12571AE0045DDF6-mehlhorn85a
DOI: 10.1016/0020-0190(85)90096-1
BibTex Citekey: Mannila-Mehlhorn_IPL85

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Information Processing Letters

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 21 (5) Sequence Number: - Start / End Page: 269 - 272 Identifier: ISSN: 0020-0190
CoNE: https://pure.mpg.de/cone/journals/resource/954921346222