On a problem concerning piles of counters

Research output: Contribution to journal › Article › peer-review

Abstract

We show that a counter problem, originating from group theory, and due to R. Solomon, is NP-hard.

@article{7d8660d430e14f298b66f89fa3cf60a4,

title = "On a problem concerning piles of counters",

abstract = "We show that a counter problem, originating from group theory, and due to R. Solomon, is NP-hard.",

author = "K. Edwards",

year = "1996",

language = "English",

volume = "156",

pages = "263--264",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - On a problem concerning piles of counters

AU - Edwards, K.

PY - 1996

Y1 - 1996

N2 - We show that a counter problem, originating from group theory, and due to R. Solomon, is NP-hard.

AB - We show that a counter problem, originating from group theory, and due to R. Solomon, is NP-hard.

UR - http://www.scopus.com/inward/record.url?scp=0041632283&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0041632283

SN - 0012-365X

VL - 156

SP - 263

EP - 264

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -