Content deleted Content added
mNo edit summary |
|||
Line 80:
|}
==
<references>
Line 137:
</references>
* {{Cite journal |last=Bell |first=Paul |last2=Potapov |first2=Igor |date=2008-02-04 |title=On undecidability bounds for matrix decision problems |url=https://www.sciencedirect.com/science/article/pii/S0304397507007840 |journal=Theoretical Computer Science |series=Combinatorics, Automata and Number Theory |volume=391 |issue=1 |pages=3–13 |doi=10.1016/j.tcs.2007.10.025 |issn=0304-3975}}
* {{Cite report |url=https://dl.acm.org/doi/10.5555/893250 |title=Decidable and Undecidable Problems in Matrix Theory |last=Halava |first=Vesa |date=1997-08 |publisher=Turku Centre for Computer Science |doi=10.5555/893250}}>
{{comp-sci-stub}}
|