scientific article; zbMATH DE number 2019634
From MaRDI portal
Publication:4440437
zbMATH Open1028.68947MaRDI QIDQ4440437FDOQ4440437
Authors: Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano 
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?)
Recommendations
- scientific article; zbMATH DE number 1256635
- 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
- scientific article; zbMATH DE number 1304339
- Rigorous results for random (\(2+p)\)-SAT
- Probabilistic checking of proofs
- On characterizations of randomized computation using plain Kolmogorov complexity
- On characterizations of randomized computation using plain Kolmogorov complexity
Randomized algorithms (68W20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (11)
- On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography
- Randomness-efficient non-interactive zero knowledge
- Perfect Non-interactive Zero Knowledge for NP
- Title not available (Why is that?)
- Derandomization in Cryptography
- Nondeterministic seedless oritatami systems and hardness of testing their equivalence
- Advances in Cryptology - CRYPTO 2003
- Cryptography in the multi-string model
- Input-oblivious proof systems and a uniform complexity perspective on P/poly
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Round complexity versus randomness complexity in interactive proofs
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)
