Title | **On the complexity of Hilbert refutations for partition** |

Author(s) | S. Margulies, Shmuel Onn, D.V. Pasechnik |

Type | Article in Journal |

Abstract | Abstract Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a Hilbert |

Keywords | Partition |

ISSN | 0747-7171 |

URL |
http://www.sciencedirect.com/science/article/pii/S0747717114000194 |

Language | English |

Journal | Journal of Symbolic Computation |

Volume | 66 |

Number | 0 |

Pages | 70 - 83 |

Year | 2015 |

Edition | 0 |

Translation |
No |

Refereed |
No |