The logic-termal equivalence is polynomial-time decidable (Q1144374): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Viktor K. Sabelfeld / rank
Normal rank
 
Property / author
 
Property / author: Viktor K. Sabelfeld / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4107904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On formalised computer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Äquivalente Transformationen für Flußdiagramme / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:20, 13 June 2024

scientific article
Language Label Description Also known as
English
The logic-termal equivalence is polynomial-time decidable
scientific article

    Statements

    The logic-termal equivalence is polynomial-time decidable (English)
    0 references
    1980
    0 references
    0 references
    polynomial-time decidable
    0 references
    logic-termal equivalence
    0 references
    program scheme
    0 references
    logical graphs
    0 references