Deciding bisimilarity is P-complete (Q1203120): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q407593
Add wikidata item.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Miklos Santha / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformity within \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: CCS expressions, finite state processes, and three problems of equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete axiomatisation for observational congruence of finite-state behaviours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated analysis of mutual exclusion algorithms using CCS / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130991537 / rank
 
Normal rank

Latest revision as of 09:02, 12 December 2024

scientific article
Language Label Description Also known as
English
Deciding bisimilarity is P-complete
scientific article

    Statements

    Identifiers

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