On the complexity of Hilbert refutations for partition
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's Nullstellensatz refutation, or certificate, that...
Main Authors: | Margulies, S, Onn, S, Pasechnik, D |
---|---|
Format: | Journal article |
Udgivet: |
2015
|
Lignende værker
-
On the complexity of Hilbert refutations for partition
af: Margulies, S, et al.
Udgivet: (2015) -
On the complexity of Hilbert refutations for partition
af: Margulies, S, et al.
Udgivet: (2014) -
The Meaning of 'Refutation' in Kant's Refutation of Idealism
af: Hyoung Sung Kim
Udgivet: (2024-03-01) -
Dialectic and Refutation in Plato. On the Role of Refutation in the Search for Truth
af: Graciela Marcos
Udgivet: (2022-06-01) -
Strict finitism refuted?
af: Magidor, O
Udgivet: (2007)