On the zero-inequivalence problem for loop programs (Q1171383): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Complete and Consistent Hoare Axiomatics for a Simple Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Program Scheme Equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of automaton identification from given data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Equivalence Problem for Simple Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified undecidable and NP-hard problems for simple programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of simple arithmetic expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3904048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of an arbitrary diophantine equation to one in 13 unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Equivalence Problem of Simple Programs / rank
 
Normal rank

Revision as of 17:23, 13 June 2024

scientific article
Language Label Description Also known as
English
On the zero-inequivalence problem for loop programs
scientific article

    Statements