A Subquadratic Approximation Scheme for Partition

The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an \(\widetilde{O}(n+1/\varepsilon^{5/3})\) time randomized FPTAS for Partition, which is derived from a certain relaxed form of a randomized FPTAS f...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Mucha, Marcin, Węgrzycki, Karol, Włodarczyk, Michał
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 06.05.2019
Predmet:	Algorithms Approximation Combinatorial analysis Complexity Convolution Lower bounds Mathematical analysis Partitions Polynomials Randomization
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!