On the complexity of realizations of Boolean functions in some classes of hypercontact circuits (Q6548985)

From MaRDI portal





scientific article; zbMATH DE number 7858820
Language Label Description Also known as
default for all languages
No label defined
    English
    On the complexity of realizations of Boolean functions in some classes of hypercontact circuits
    scientific article; zbMATH DE number 7858820

      Statements

      On the complexity of realizations of Boolean functions in some classes of hypercontact circuits (English)
      0 references
      0 references
      3 June 2024
      0 references
      polynomial with idempotent variables
      0 references
      hypercontact circuit
      0 references
      contact hypergraph
      0 references
      contact matroid
      0 references
      incidence-linking matrix
      0 references
      contact-transformer circuit
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references