scientific article; zbMATH DE number 1154176

zbMATH Open0890.06002MaRDI QIDQ4389705FDOQ4389705

Authors: M. Gavalec 

Publication date: 18 May 1998

Full work available at URL: https://eudml.org/doc/34438

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3855106
• Algorithms for dualization over products of partially ordered sets
• Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
• scientific article; zbMATH DE number 4200270
• SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES

zbMATH Keywords

NP-completenesspartial orderpolynomial algorithmconsistent choice problem

Mathematics Subject Classification ID

Partial orders, general (06A06) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• The Problem of Compatible Representatives
• The complexity of theorem-proving procedures
• Title not available (Why is that?)
• Balanced location on a graph

Cited In (2)

• SOME ORDER DUALITIES IN LOGIC, GAMES AND CHOICES
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389705)