Pages that link to "Item:Q1854456"
From MaRDI portal
The following pages link to On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456):
Displaying 23 items.
- Size complexity of rotating and sweeping automata (Q414916) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- Infinite vs. finite size-bounded randomized computations (Q2637645) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Converting Self-verifying Automata into Deterministic Automata (Q3618603) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Self-Verifying Pushdown and Queue Automata (Q5164866) (← links)
- An upper bound for transforming self-verifying automata into deterministic ones (Q5425747) (← links)
- Exact Affine Counter Automata (Q6114873) (← links)
- Lifting query complexity to time-space complexity for two-way finite automata (Q6141040) (← links)
- Error-Free Affine, Unitary, and Probabilistic OBDDs (Q6169903) (← links)
- Iterative arrays with self-verifying communication cell (Q6195133) (← links)
