A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (Q1247317): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56059275, #quickstatements; #temporary_batch_1704701117765
Created claim: DBLP publication ID (P1635): journals/jcss/Oppen78, #quickstatements; #temporary_batch_1731483406851
 
(4 intermediate revisions by 4 users not shown)
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/0022-0000(78)90021-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2008770192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082296 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jcss/Oppen78 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:50, 13 November 2024

scientific article
Language Label Description Also known as
English
A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
scientific article

    Statements

    A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic (English)
    0 references
    0 references
    1978
    0 references

    Identifiers