Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 31 results in range #1 to #31.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Quantum Complexity of Boolean Matrix Multiplication and Related Problems: Label: en
  2. Complexity of Promise Problems on Classical and Quantum Automata: Label: en
  3. Computing Boolean Functions via Quantum Hashing: Label: en
  4. Time-Optimum Smaller-State Synchronizers for Cellular Automata: Label: en
  5. Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem: Label: en
  6. A Weakly Universal Cellular Automaton in the Pentagrid with Five States: Label: en
  7. Aspects of Reversibility for Classical Automata: Label: en
  8. On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages: Label: en
  9. Advances on Random Sequence Generation by Uniform Cellular Automata: Label: en
  10. On Power Series over a Graded Monoid: Label: en
  11. Soliton Automata with Multiple Waves: Label: en
  12. Systolic Automata and P Systems: Label: en
  13. Counting with Probabilistic and Ultrametric Finite Automata: Label: en
  14. Minimal Reaction Systems Defining Subset Functions: Label: en
  15. A Robust Universal Flying Amorphous Computer: Label: en
  16. P Systems with Anti-Matter: Label: en
  17. On the Limit of Some Algorithmic Approach to Circuit Lower Bounds: Label: en
  18. A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems: Label: en
  19. How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?: Label: en
  20. One-Sided Random Context Grammars: A Survey: Label: en
  21. Learning from Positive Data and Negative Counterexamples: A Survey: Label: en
  22. Symmetries and Dualities in Name-Passing Process Calculi: Label: en
  23. Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources: Label: en
  24. Integral Difference Ratio Functions on Integers: Label: en
  25. A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey: Label: en
  26. Small Universal Devices: Label: en
  27. From Quantum Query Complexity to State Complexity: Label: en
  28. Physical Aspects of Oracles for Randomness and Hadamard’s Conjecture: Label: en
  29. Quantum Finite Automata: A Modern Introduction: Label: en
  30. Maximally Entangled State in Pseudo-Telepathy Games: Label: en
  31. Quantum Distributed Computing Applied to Grover’s Search Algorithm: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)