The 0-1 integer programming problem in a finite ring with identity

DOI10.1016/0898-1221(81)90033-XzbMath0466.90088OpenAlexW1974151928MaRDI QIDQ1155522

Bart F. Rice

Publication date: 1981

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90033-x

zbMATH Keywords

NP-completenessenumerative algorithmfinite ring with identity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Finite rings and finite-dimensional associative algebras (16P10) Programming in abstract spaces (90C48) Finite fields and commutative rings (number-theoretic aspects) (11T99) Boolean programming (90C09)

Related Items

Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Reducibility among Combinatorial Problems
• Distance-2 Cyclic Chaining of Constant-Weight Codes
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Unnamed Item
• Unnamed Item