scientific article; zbMATH DE number 15249

MaRDI QIDQ3977578zbMATH OpenFDO

Authors Manuel E. Bermudez, George Logothetis

Publication date 25 June 1992

zbMATH Keywords

parallel computationlanguage processingclosure on finite subset relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Distributed algorithms (68W15) Other classical set theory (including functions, relations, and set algebra) (03E20)

Recommendations

• Parallelizing the closure computation in automated deduction
• scientific article; zbMATH DE number 1948455
• scientific article; zbMATH DE number 1849117
• scientific article; zbMATH DE number 4172390
• On computing graph closures

Cited in

(5)

• Parallel integer relation detection: techniques and applications
• Parallelizing the closure computation in automated deduction
• scientific article; zbMATH DE number 4172390 (Why is no real title available?)
• scientific article; zbMATH DE number 7566062 (Why is no real title available?)
• Computations with finite closure systems and implications

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