On undecidability bounds for matrix decision problems (Q2474220): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2007.10.025 / rank
Normal rank
 
Property / author
 
Property / author: Igor Potapov / rank
Normal rank
 
Property / author
 
Property / author: Igor Potapov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013166518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is a pair of matrices mortal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mortality problem for matrices of low dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examples of undecidable problems for 2-generator matrix semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mortality in Matrix Semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved matrix pair undecidability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed-form analytic maps in one and two dimensions can simulate universal Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconventional Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in One-Dimensional Piecewise Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for semi-Thue systems with a few rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolvability in 3 × 3 Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Developments in Language Theory / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2007.10.025 / rank
 
Normal rank

Latest revision as of 20:55, 18 December 2024

scientific article
Language Label Description Also known as
English
On undecidability bounds for matrix decision problems
scientific article

    Statements

    On undecidability bounds for matrix decision problems (English)
    0 references
    0 references
    0 references
    5 March 2008
    0 references
    computability theory
    0 references
    membership
    0 references
    vector reachability
    0 references
    matrix semigroups
    0 references
    piecewise linear maps
    0 references

    Identifiers