Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 journals/algorithmica/SubramaniW19
%A Subramani, K.
%A Wojciechowski, Piotr
%D 2019
%J Algorithmica
%K dblp
%N 7
%P 2765-2794
%T A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.
%U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#SubramaniW19
%V 81
@article{journals/algorithmica/SubramaniW19,
added-at = {2024-02-09T00:00:00.000+0100},
author = {Subramani, K. and Wojciechowski, Piotr},
biburl = {https://www.bibsonomy.org/bibtex/2ab6d8400e7fb1019da07b66d092e12bc/dblp},
ee = {https://doi.org/10.1007/s00453-019-00554-z},
interhash = {d1d289bd314bba39ad143aa4b89938ee},
intrahash = {ab6d8400e7fb1019da07b66d092e12bc},
journal = {Algorithmica},
keywords = {dblp},
number = 7,
pages = {2765-2794},
timestamp = {2024-04-08T18:21:11.000+0200},
title = {A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints.},
url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#SubramaniW19},
volume = 81,
year = 2019
}