scientific article; zbMATH DE number 3635490
From MaRDI portal
Publication:4195937
zbMath0408.68035MaRDI QIDQ4195937
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)
Related Items
Very narrow quantum OBDDs and width hierarchies for classical OBDDs ⋮ On relations between counting communication complexity classes ⋮ Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations ⋮ On randomized versus deterministic computation ⋮ Secret sharing based on a hard-on-average problem ⋮ Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes ⋮ On randomized versus deterministic computation ⋮ Checking properties of polynomials ⋮ Classical and Quantum Counter Automata on Promise Problems ⋮ Quantum versus classical online streaming algorithms with logarithmic size of memory ⋮ Indistinguishability and First-Order Logic ⋮ Classical and quantum algorithms for constructing text from dictionary problem ⋮ Automating algorithm selection: checking for matrix properties that can simplify computations ⋮ Classical and Quantum Algorithms for Assembling a Text from a Dictionary ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Unnamed Item ⋮ Testable and untestable classes of first-order formulae ⋮ Lower bounds for one-way probabilistic communication complexity ⋮ Quantum Pushdown Automata with Garbage Tape ⋮ Batch checking with applications to linear functions ⋮ Verification protocols with sub-linear communication for polynomial matrix operations ⋮ A probabilistic algorithm for verifying matrix products using \(O(n^ 2)\) time and \(\log_ 2n+O(1)\) random bits ⋮ A low complexity probabilistic test for integer multiplication ⋮ Quantum Random Walks – New Method for Designing Quantum Algorithms ⋮ Elimination-based certificates for triangular equivalence and rank profiles ⋮ From Logic to Theoretical Computer Science – An Update ⋮ Recursive Double-Size Fixed Precision Arithmetic ⋮ Probabilistic checking of associativity in algebras ⋮ Relational Properties Expressible with One Universal Quantifier Are Testable ⋮ Randomised algorithms ⋮ Quantum algorithms for string processing ⋮ Unnamed Item ⋮ Polynomial modular product verification and its implications ⋮ Bounds on sample space size for matrix product verification ⋮ Bootstrapping the operator norm in high dimensions: error estimation for covariance matrices and sketching ⋮ Self-testing/correcting with applications to numerical problems
