On the Complexity of 2D Discrete Fixed Point Problem.


https://doi.org/10.1007/11786986_43
@inproceedings{DBLP:conf/icalp/ChenD06, author = {Xi Chen and Xiaotie Deng}, editor = {Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener}, title = {On the Complexity of 2D Discrete Fixed Point Problem}, booktitle = {Automata, Languages and Programming, 33rd International Colloquium, {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {4051}, pages = {489--500}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11786986\_43}, doi = {10.1007/11786986\_43}, timestamp = {Wed, 19 Jun 2019 15:13:46 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChenD06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21