scientific article; zbMATH DE number 4172390

MaRDI QIDQ3197328zbMATH OpenFDO

Authors Rossella Petreschi, Paola Marchioro, Aurora Morgana

Publication date 1989

zbMATH Keywords

binary relationsparallel on-line algorithmparallel random access machine

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15)

Recommendations

• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• On binary constraint problems
• A binary relation inference network Part 1. General concepts
• Fast parallel constraint satisfaction
• scientific article; zbMATH DE number 15249

Cited in

(4)

• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• scientific article; zbMATH DE number 15249 (Why is no real title available?)
• scientific article; zbMATH DE number 1923144 (Why is no real title available?)
• A binary relation inference network Part 1. General concepts

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 Q3197328)