scientific article; zbMATH DE number 1254029

MaRDI QIDQ4227012zbMATH OpenFDO

Authors Masayuki Noro, John McKay

Publication date 1 September 1999

zbMATH Keywords

Gröbner basis computationodd replication orderpartial parallelization of Buchberger's algorithmreplicable functions

Mathematics Subject Classification ID

Relationship to Lie algebras and finite simple groups (11F22) Analytic computations (11Y35) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Simple groups: sporadic groups (20D08)

Recommendations

• Replicable functions: A computational approach
• Representations and Parallel Computations for Rational Functions
• Decomposing Replicable Functions
• Parallel repetition of computationally sound protocols revisited
• Parallel Repetition of Computationally Sound Protocols Revisited
• On Distributed Computing for Functions With Certain Structures
• The parallel complexity of function approximation
• Computing functions with parallel queries to NP
• Resource bounds for parallel computation of threshold and symmetric functions
• On the complexity of functions for random access machines

Describes a project that uses

Uses Software

• Risa/Asir

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