English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  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, 269-272.

Item is

 

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/11858/00-001M-0000-0014-AEE2-8
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mannila, Heikki1, Author           
Mehlhorn, Kurt1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-08-091985
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 344598
Other: Local-ID: C1256428004B93B8-10C573887897F861C12571AE0045DDF6-mehlhorn85a
 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: -
Pages: - Volume / Issue: 21 Sequence Number: - Start / End Page: 269 - 272 Identifier: -