„probabilistic proof systems“

Suchergebnisse

11 Treffer

• Yet Another Simple Proof of the PCRP Theorem
  Ohsaka, Naoto 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration
  Hirahara, Shuichi ; Ohsaka, Naoto 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Smooth and Strong PCPs
  Paradise, Orr 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Exponential Separation Between MA and AM Proofs of Proximity
  Gur, Tom ; Liu, Yang P. ; Rothblum, Ron D. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Semi-Streaming Algorithms for Annotated Graph Streams
  Thaler, Justin 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Identifying an Honest EXP^NP Oracle Among Many
  Hirahara, Shuichi 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Special Topics in Mathematics for Computer Scientists – Sets, Categories, Topologies and Measures
  Doberkat, Ernst-Erich 2015 Springer International Publishing
• Probabilistic proof of the interchangeability of ./M/1 queues in series
  Anantharam, V.
• Abstraction, Refinement and Proof for Probabilistic Systems
  2005 Springer Berlin Heidelberg
• Complete Proof Systems for Amortised Probabilistic Bisimulations
  Xu, Li-li ; Lin, Hui-Min
• Non-uniform proof systems – a new framework to describe non-uniform and probabilistic complexity classes
  Kämper, Jürgen 1987 Univ., Fachbereich Informatik