The following pages link to (Q4195937):
Displaying 35 items.
- Testable and untestable classes of first-order formulae (Q440006) (← links)
- Probabilistic checking of associativity in algebras (Q752151) (← links)
- A low complexity probabilistic test for integer multiplication (Q983183) (← links)
- Batch checking with applications to linear functions (Q1198028) (← links)
- A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits (Q1209332) (← links)
- Bounds on sample space size for matrix product verification (Q1313769) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- On randomized versus deterministic computation (Q1365675) (← links)
- Randomised algorithms (Q1836980) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- Quantum algorithms for string processing (Q2091414) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching (Q2108486) (← links)
- Elimination-based certificates for triangular equivalence and rank profiles (Q2284959) (← links)
- Very narrow quantum OBDDs and width hierarchies for classical OBDDs (Q2361670) (← links)
- Secret sharing based on a hard-on-average problem (Q2369061) (← links)
- Automating algorithm selection: checking for matrix properties that can simplify computations (Q2422701) (← links)
- Recursive Double-Size Fixed Precision Arithmetic (Q2819221) (← links)
- Classical and Quantum Counter Automata on Promise Problems (Q2947425) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
- Checking properties of polynomials (Q4571953) (← links)
- On randomized versus deterministic computation (Q4630263) (← links)
- Lower bounds for one-way probabilistic communication complexity (Q4630264) (← links)
- (Q4633051) (← links)
- Quantum Pushdown Automata with Garbage Tape (Q4640342) (← links)
- (Q5009621) (← links)
- Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations (Q5042223) (← links)
- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes (Q5047165) (← links)
- Quantum Random Walks – New Method for Designing Quantum Algorithms (Q5448636) (← links)
- From Logic to Theoretical Computer Science – An Update (Q5452171) (← links)
- Quantum versus classical online streaming algorithms with logarithmic size of memory (Q6043926) (← links)
- Classical and quantum algorithms for constructing text from dictionary problem (Q6095516) (← links)
- Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond (Q6172035) (← links)
