scientific article; zbMATH DE number 2019634

zbMATH Open1028.68947MaRDI QIDQ4440437FDOQ4440437

Alfredo De Santis, Giuseppe Persiano, Giovanni Di Crescenzo

Publication date: 17 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2483/24830179.htm

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Randomized algorithms (68W20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (5)

• Perfect Non-interactive Zero Knowledge for NP
• Title not available (Why is that?)
• Nondeterministic seedless oritatami systems and hardness of testing their equivalence
• Cryptography in the multi-string model
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs

   Recommendations

• Title not available (Why is that?) 👍 👎
• Nondeterministic functions and the existence of optimal proof systems 👍 👎
• Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs 👍 👎
• Randomisation and derandomisation in descriptive complexity theory 👍 👎
• Randomisation and derandomisation in descriptive complexity theory 👍 👎
• Title not available (Why is that?) 👍 👎
• Rigorous results for random (\(2+p)\)-SAT 👍 👎
• Probabilistic checking of proofs 👍 👎
• On characterizations of randomized computation using plain Kolmogorov complexity1 👍 👎
• On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440437)