The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/0304-3975(82)90115-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992963060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logical theories / 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: A Decision Procedure for the First Order Theory of Real Addition with Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on Solutions of Linear Integer Equalities and Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5772619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Presburger arithmetic with bounded quantifier alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Formal Systems. (AM-47) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:34, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of Presburger arithmetic with bounded quantifier alternation depth
scientific article

    Statements

    Identifiers