Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Lattice basis reduction has important applications in the areas of computer algebra, cryptography and combinatorial optimization. Several efficient sequential algorithms are known. Recently, parallel algorithms have been developed but until now a formal proof for the efficiency of parallel algorithms with n/sup 2/ processors has been omitted, where n denotes the dimension of the lattice. , a variant of the ll-known basis reduction algorithms is presented that is ll suited for the computation with fast floating point arithmetic and for the implementation on a mesh-connected array of n/sup 2/ processors. In addition, an error analysis and a proof of the parallel efficiency is provided. >
['Christian Heckler', 'Lothar Thiele']
I am writing a research paper on a idea A parallel lattice basis reduction for mesh-connected processor arrays and parallel complexity
[{"from": "human", "value": "I am writing a research paper on a idea A parallel lattice basis reduction for mesh-connected processor arrays and parallel complexity"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Lattice basis reduction has important applications in the areas of computer algebra, cryptography and combinatorial optimization. Several efficient sequential algorithms are known. Recently, parallel algorithms have been developed but until now a formal proof for the efficiency of parallel algorithms with n/sup 2/ processors has been omitted, where n denotes the dimension of the lattice. , a variant of the ll-known basis reduction algorithms is presented that is ll suited for the computation with fast floating point arithmetic and for the implementation on a mesh-connected array of n/sup 2/ processors. In addition, an error analysis and a proof of the parallel efficiency is provided. >"}]