scientific article
From MaRDI portal
Publication:3359734
zbMath0733.68005MaRDI QIDQ3359734
Joan Feigenbaum, Donald Beaver
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (33)
An information-theoretic treatment of random-self-reducibility ⋮ Probabilistic proof systems — A survey ⋮ Circuit lower bounds from learning-theoretic approaches ⋮ Average-case intractability vs. worst-case intractability ⋮ Secure outsourcing of modular exponentiations under single untrusted programme model ⋮ Upper bound on the communication complexity of private information retrieval ⋮ On locally decodable codes, self-correctable codes, and \(t\)-private PIR ⋮ Unnamed Item ⋮ The power of natural properties as oracles ⋮ Approximate testing with error relative to input size. ⋮ Succinct arguments for RAM programs via projection codes ⋮ Unnamed Item ⋮ Secure circuit evaluation. A protocol based on hiding information from an oracle ⋮ Program result checking: A new approach to making programs more reliable ⋮ Hypercubes and Private Information Retrieval ⋮ Locally Decodable Codes: A Brief Survey ⋮ Locally random reductions: Improvements and applications ⋮ Arithmetization: A new method in structural complexity theory ⋮ Non-deterministic exponential time has two-prover interactive protocols ⋮ Highly resilient correctors for polynomials ⋮ On the power of two-local random reductions ⋮ General constructions for information-theoretic private information retrieval ⋮ Pseudorandom generators without the XOR lemma ⋮ Exponential lower bound for 2-query locally decodable codes via a quantum argument ⋮ Efficient learning algorithms yield circuit lower bounds ⋮ Unnamed Item ⋮ Protecting data privacy in private information retrieval schemes ⋮ Hardness of learning problems over Burnside groups of exponent 3 ⋮ Self-testing/correcting with applications to numerical problems ⋮ Randomness vs time: Derandomization under a uniform assumption ⋮ Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority ⋮ Reed-Muller Codes ⋮ PSPACE is provable by two provers in one round
This page was built for publication:
