Diophantine equations, Presburger arithmetic and finite automata (Q5878899): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-61064-2_27 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1540012118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient incremental algorithm for solving systems of linear diophantine equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank

Latest revision as of 14:21, 31 July 2024

scientific article; zbMATH DE number 7656664
Language Label Description Also known as
English
Diophantine equations, Presburger arithmetic and finite automata
scientific article; zbMATH DE number 7656664

    Statements

    Diophantine equations, Presburger arithmetic and finite automata (English)
    0 references
    0 references
    0 references
    23 February 2023
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references