![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/stoc/AllenderBO96
@inproceedings{DBLP:conf/stoc/AllenderBO96, author = {Eric Allender and Robert Beals and Mitsunori Ogihara}, editor = {Gary L. Miller}, title = {The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996}, pages = {161--167}, publisher = {{ACM}}, year = {1996}, url = {https://doi.org/10.1145/237814.237856}, doi = {10.1145/237814.237856}, timestamp = {Sun, 25 Oct 2020 22:32:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AllenderBO96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.