From Wikipedia, the free encyclopedia
| Welcome to the Wikipedia Mathematics Reference Desk Archives |
| The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
[edit] October 28
[edit] Distributed processing multiple state logic reduction
Does there exist a method to reduce multiple state logic equations within a distributed processing environment? Clem 03:25, 28 October 2007 (UTC)
- Can you expain why this method would not work for each state? Quine-McCluskey_algorithm?
- Perhaps in referring to distributed processing envrionments, you looking for syncrincation primivives that would allow you to condense results? I would think that divide and conqure method. i.e. divide the problem into a set of states, and feed those states into a given number of processors, and condense the results based upon a calculated measure. Since this type of problem is NP-complete, that is, it will not scale in polonomial time, it behoves you to use distrubuted processing to solve problems of this sort. Artoftransformation 11:17, 3 November 2007 (UTC)
