Geodesic
The complexity of additive computations of the sets of integer linear forms
Zapiski Nauchnykh Seminarov POMI, Theoretical application of methods of mathematical logic. Part III, Tome 105 (1981), pp. 53-61 
A. F. Sidorenko. The complexity of additive computations of the sets of integer linear forms. Zapiski Nauchnykh Seminarov POMI, Theoretical application of methods of mathematical logic. Part III, Tome 105 (1981), pp. 53-61. http://geodesic.mathdoc.fr/item/ZNSL_1981_105_a6/
@article{ZNSL_1981_105_a6,
     author = {A. F. Sidorenko},
     title = {The complexity of additive computations of the sets of integer linear forms},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {53--61},
     year = {1981},
     volume = {105},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1981_105_a6/}
}
TY  - JOUR
AU  - A. F. Sidorenko
TI  - The complexity of additive computations of the sets of integer linear forms
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1981
SP  - 53
EP  - 61
VL  - 105
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1981_105_a6/
LA  - ru
ID  - ZNSL_1981_105_a6
ER  - 
%0 Journal Article
%A A. F. Sidorenko
%T The complexity of additive computations of the sets of integer linear forms
%J Zapiski Nauchnykh Seminarov POMI
%D 1981
%P 53-61
%V 105
%U http://geodesic.mathdoc.fr/item/ZNSL_1981_105_a6/
%G ru
%F ZNSL_1981_105_a6

Voir la notice du chapitre de livre provenant de la source Math-Net.Ru

An additive computation of a set of linear forms may be presented as the consequence of square matrices $Q_1,\dots,Q_T$ ($Q_i$ equals the unit matrix increased or decreased by 1 in some entry). Thus the additive complexity of a set is the length of the corresponding shortest consequence. A connection between the additive complexity of a set with coefficient matrix $A$ and the complexity of a set with matrix $A^T$ is proved.