Pages that link to "Item:Q3192036"
From MaRDI portal
The following pages link to On quantum and probabilistic communication (Q3192036):
Displaying 22 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Superiority of exact quantum automata for promise problems (Q413305) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- Unary probabilistic and quantum automata on promise problems (Q1617185) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Improved constructions for succinct affine automata (Q2096598) (← links)
- Energy complexity of regular language recognition (Q2164753) (← links)
- Quantum Finite Automata: A Modern Introduction (Q2944891) (← links)
- From Quantum Query Complexity to State Complexity (Q2944893) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Lower Bounds for Las Vegas Automata by Information Theory (Q4462677) (← links)
- Pointer chasing via triangular discrimination (Q4993101) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- Lower bounds in communication complexity based on factorization norms (Q5902088) (← 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)
- Energy complexity of regular languages (Q6199407) (← links)
