Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
On the hardness of finding sub...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
On the hardness of finding subsets with equal average
Bibliographic Details
Main Authors:
Elkind, E
,
Orlin, J
Format:
Journal article
Published:
2013
Holdings
Description
Similar Items
Staff View
Similar Items
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect
by: Demaine, Erik D
Published: (2020)
Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect
by: Cardinal, Jean, et al.
Published: (2021)
On the variance of average distance of subsets in the Hamming space
by: Fu, Fang-Wei, et al.
Published: (2013)
A novel approach to find partitions of $ Z_{m} $ with equal sum subsets via complete graphs
by: M. Haris Mateen, et al.
Published: (2021-07-01)
Pigeonhole Equal Subset Sum in O ⃰ (2ⁿ/³)
by: Zhang, Stan
Published: (2024)