Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleOn the complexity of Hilbert refutations for partition
Author(s) S. Margulies, Shmuel Onn, D.V. Pasechnik
TypeArticle in Journal
AbstractAbstract 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
KeywordsPartition
ISSN0747-7171
URL http://www.sciencedirect.com/science/article/pii/S0747717114000194
LanguageEnglish
JournalJournal of Symbolic Computation
Volume66
Number0
Pages70 - 83
Year2015
Edition0
Translation No
Refereed No
Webmaster