The following pages link to Computing with New Resources (Q2944873):
Displaying 31 items.
- Counting with Probabilistic and Ultrametric Finite Automata (Q2944874) (← links)
- Systolic Automata and P Systems (Q2944875) (← links)
- Soliton Automata with Multiple Waves (Q2944877) (← links)
- On Power Series over a Graded Monoid (Q2944878) (← links)
- Advances on Random Sequence Generation by Uniform Cellular Automata (Q2944879) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- A Weakly Universal Cellular Automaton in the Pentagrid with Five States (Q2944882) (← links)
- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem (Q2944883) (← links)
- Time-Optimum Smaller-State Synchronizers for Cellular Automata (Q2944884) (← links)
- Computing Boolean Functions via Quantum Hashing (Q2944885) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
- Quantum Distributed Computing Applied to Grover’s Search Algorithm (Q2944889) (← links)
- Maximally Entangled State in Pseudo-Telepathy Games (Q2944890) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- Physical Aspects of Oracles for Randomness and Hadamard’s Conjecture (Q2944892) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Small Universal Devices (Q2944894) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Integral Difference Ratio Functions on Integers (Q2944896) (← links)
- Conditional Lindenmayer Systems with Conditions Defined by Bounded Resources (Q2944897) (← links)
- Symmetries and Dualities in Name-Passing Process Calculi (Q2944898) (← links)
- Learning from Positive Data and Negative Counterexamples: A Survey (Q2944899) (← links)
- One-Sided Random Context Grammars: A Survey (Q2944900) (← links)
- How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory? (Q2944902) (← links)
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems (Q2944903) (← links)
- On the Limit of Some Algorithmic Approach to Circuit Lower Bounds (Q2944904) (← links)
- A Robust Universal Flying Amorphous Computer (Q2944906) (← links)
- Minimal Reaction Systems Defining Subset Functions (Q2944907) (← links)
- P Systems with Anti-Matter (Q5892153) (← links)
