English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  Satisfiability of Functional+Record Subtype Constraints is NP-Hard

Vorobyov, S.(1998). Satisfiability of Functional+Record Subtype Constraints is NP-Hard (MPI-I-1998-2-004). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-7B51-7 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-9BAC-C
Genre: Report

Files

show Files
hide Files
:
1998-2-004 (Any fulltext), 10KB
View   Save
File Permalink:
https://hdl.handle.net/11858/00-001M-0000-0014-7B53-3
Name:
1998-2-004
Description:
-
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
text/html / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Vorobyov, Sergei1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We show the NP-hardness of the satisfiability problem for subtype inequalities between object types built by using simultaneously both the functional and the record type constructors, without base types. Earlier research concentrated on the complexity of subtyping either solely functional, or solely record types. In both cases deterministic cubic time algorithms are known.

Details

show
hide
Language(s): eng - English
 Dates: 1998
 Publication Status: Issued
 Pages: 16 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Type: -
 Identifiers: URI: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-2-004
Report Nr.: MPI-I-1998-2-004
BibTex Citekey: Vorobyov98-2-004
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -