Pages that link to "Item:Q3732965"
From MaRDI portal
The following pages link to Parallel computation for well-endowed rings and space-bounded probabilistic machines (Q3732965):
Displayed 42 items.
- Decreasing the bandwidth of a transition matrix (Q673904) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- On some variations of two-way probabilistic finite automata models (Q880179) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- Space-bounded hierarchies and probabilistic computations (Q1062759) (← links)
- Fast parallel absolute irreducibility testing (Q1080657) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- The iterated mod problem (Q1119390) (← links)
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems (Q1120597) (← links)
- Circuits for computing the GCD of two polynomials over an algebraic number field (Q1178209) (← links)
- Matrix inversion in RNC\(^ 1\) (Q1179457) (← links)
- A survey of space complexity (Q1193412) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- On read-once vs. multiple access to randomness in logspace (Q1208412) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\) (Q1288206) (← links)
- Oracle computations in parallel numerical linear algebra (Q1325837) (← links)
- On path equivalence of nondeterministic finite automata (Q1351166) (← links)
- On randomized versus deterministic computation (Q1365675) (← links)
- Circuits over PP and PL (Q1567408) (← links)
- Random parallel algorithms for finding exact branchings, perfect matchings, and cycles (Q1891230) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Space-bounded quantum complexity (Q1961378) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Inversion in finite fields using logarithmic depth (Q2638778) (← links)
- On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape (Q2946415) (← links)
- Advice Coins for Classical and Quantum Computation (Q3012792) (← links)
- Closed timelike curves make quantum and classical computing equivalent (Q3561861) (← links)
- On the parallel complexity of linear groups (Q3988804) (← links)
- Lower space bounds for randomized computation (Q4632458) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- A Complete Characterization of Unitary Quantum Space (Q4993267) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)