Derandomization with Pseudorandomness
Fuente:
arXiv
Guardado en:
| Autor principal: | Karayel, Emin |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Modular First Formalisation of Combinatorial Design Theory
por: Edmonds, Chelsea, et al.
Publicado: (2021)
por: Edmonds, Chelsea, et al.
Publicado: (2021)
Formalizing MLTL Formula Progression in Isabelle/HOL
por: Kosaian, Katherine, et al.
Publicado: (2024)
por: Kosaian, Katherine, et al.
Publicado: (2024)
Formally Verifying a Transformation from MLTL Formulas to Regular Expressions
por: Wang, Zili, et al.
Publicado: (2025)
por: Wang, Zili, et al.
Publicado: (2025)
Proof complexity of universal algebra in a CSP dichotomy proof
por: Gaysin, Azza
Publicado: (2024)
por: Gaysin, Azza
Publicado: (2024)
A proof complexity conjecture and the Incompleteness theorem
por: Krajicek, Jan
Publicado: (2023)
por: Krajicek, Jan
Publicado: (2023)
Mechanised uniform interpolation for modal logics K, GL, and iSL
por: Férée, Hugo, et al.
Publicado: (2024)
por: Férée, Hugo, et al.
Publicado: (2024)
Universal Gluing and Contextual Choice: Categorical Logic and the Foundations of Analytic Approximation
por: Santacana, Andreu Ballus
Publicado: (2025)
por: Santacana, Andreu Ballus
Publicado: (2025)
Continuous and algebraic domains in univalent foundations
por: de Jong, Tom, et al.
Publicado: (2024)
por: de Jong, Tom, et al.
Publicado: (2024)
A declarative approach to specifying distributed algorithms using three-valued modal logic
por: Gabbay, Murdoch J., et al.
Publicado: (2025)
por: Gabbay, Murdoch J., et al.
Publicado: (2025)
Declarative distributed algorithms as axiomatic theories in three-valued modal logic over semitopologies
por: Gabbay, Murdoch J.
Publicado: (2025)
por: Gabbay, Murdoch J.
Publicado: (2025)
The Orientation Boundary for Step-Duplicating Recursors: Mechanized Impossibility, Escape, and Certification
por: Rahnama, Moses
Publicado: (2025)
por: Rahnama, Moses
Publicado: (2025)
First-Order Fischer Servi Logic
por: Christensen, Ahmee
Publicado: (2024)
por: Christensen, Ahmee
Publicado: (2024)
Nominal techniques as an Agda library
por: Gabbay, Murdoch J., et al.
Publicado: (2026)
por: Gabbay, Murdoch J., et al.
Publicado: (2026)
Tao's Equational Proof Challenge Accepted (Technical Report)
por: Kondylidou, Lydia, et al.
Publicado: (2026)
por: Kondylidou, Lydia, et al.
Publicado: (2026)
Recursive windows for grammar logics of bounded density
por: Gasquet, Olivier
Publicado: (2025)
por: Gasquet, Olivier
Publicado: (2025)
PSPACE-completeness of bimodal transitive weak-density logic
por: Balbiani, Philippe, et al.
Publicado: (2025)
por: Balbiani, Philippe, et al.
Publicado: (2025)
ProofCloud: A Proof Retrieval Engine for Verified Proofs in Higher Order Logic
por: Wang, Shuai
Publicado: (2024)
por: Wang, Shuai
Publicado: (2024)
Universal Algebra in UniMath
por: Amato, Gianluca, et al.
Publicado: (2021)
por: Amato, Gianluca, et al.
Publicado: (2021)
Evaluating Autoformalization Robustness via Semantically Similar Paraphrasing
por: Moore, Hayden, et al.
Publicado: (2025)
por: Moore, Hayden, et al.
Publicado: (2025)
Approximate Axiomatization for Differentially-Defined Functions
por: Platzer, André, et al.
Publicado: (2025)
por: Platzer, André, et al.
Publicado: (2025)
An Alternative Approach to Formal Mathematics that Focuses on Communication and Accessibility
por: Farmer, William M.
Publicado: (2026)
por: Farmer, William M.
Publicado: (2026)
Remarks on Primitive Regulation
por: Rosko, Milan
Publicado: (2026)
por: Rosko, Milan
Publicado: (2026)
A Logspace Constructive Proof of L=SL
por: Buss, Sam, et al.
Publicado: (2025)
por: Buss, Sam, et al.
Publicado: (2025)
The Directed Van Kampen Theorem in Lean
por: Basold, Henning, et al.
Publicado: (2023)
por: Basold, Henning, et al.
Publicado: (2023)
Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
por: Lopez, Aliaume
Publicado: (2024)
por: Lopez, Aliaume
Publicado: (2024)
On the existence of strong proof complexity generators
por: Krajicek, Jan
Publicado: (2022)
por: Krajicek, Jan
Publicado: (2022)
Complexities of Well-Quasi-Ordered Substructural Logics
por: Galatos, Nikolaos, et al.
Publicado: (2025)
por: Galatos, Nikolaos, et al.
Publicado: (2025)
Oruga: An Avatar of Representational Systems Theory
por: Raggi, Daniel, et al.
Publicado: (2025)
por: Raggi, Daniel, et al.
Publicado: (2025)
A Modular Lean 4 Framework for Confluence and Strong Normalization of Lambda Calculi with Products and Sums
por: Ramos, Arthur, et al.
Publicado: (2025)
por: Ramos, Arthur, et al.
Publicado: (2025)
Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
por: Borzechowski, Manfred, et al.
Publicado: (2025)
por: Borzechowski, Manfred, et al.
Publicado: (2025)
Monoid Theory in Alonzo: A Little Theories Formalization in Simple Type Theory
por: Farmer, William M., et al.
Publicado: (2023)
por: Farmer, William M., et al.
Publicado: (2023)
Continuations and Completeness in Proof-theoretic Semantics
por: Gu, Tao, et al.
Publicado: (2026)
por: Gu, Tao, et al.
Publicado: (2026)
A vector logic for extensional formal semantics
por: Quigley, Daniel
Publicado: (2024)
por: Quigley, Daniel
Publicado: (2024)
Behavioural Conformances based on Lax Couplings
por: Wild, Paul, et al.
Publicado: (2025)
por: Wild, Paul, et al.
Publicado: (2025)
Relational Models for the Lambek Calculus with Intersection and Constants
por: Kuznetsov, Stepan L.
Publicado: (2022)
por: Kuznetsov, Stepan L.
Publicado: (2022)
A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
por: Barroso-Nascimento, Victor, et al.
Publicado: (2025)
por: Barroso-Nascimento, Victor, et al.
Publicado: (2025)
E-variables and tests of randomness for distribution classes
por: Potapov, Georgii, et al.
Publicado: (2026)
por: Potapov, Georgii, et al.
Publicado: (2026)
Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
por: Walsh, Sean
Publicado: (2024)
por: Walsh, Sean
Publicado: (2024)
The Solver's Paradox in Formal Problem Spaces
por: Rosko, Milan
Publicado: (2025)
por: Rosko, Milan
Publicado: (2025)
A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
por: Bruse, Florian, et al.
Publicado: (2026)
por: Bruse, Florian, et al.
Publicado: (2026)
Ejemplares similares
-
A Modular First Formalisation of Combinatorial Design Theory
por: Edmonds, Chelsea, et al.
Publicado: (2021) -
Formalizing MLTL Formula Progression in Isabelle/HOL
por: Kosaian, Katherine, et al.
Publicado: (2024) -
Formally Verifying a Transformation from MLTL Formulas to Regular Expressions
por: Wang, Zili, et al.
Publicado: (2025) -
Proof complexity of universal algebra in a CSP dichotomy proof
por: Gaysin, Azza
Publicado: (2024) -
A proof complexity conjecture and the Incompleteness theorem
por: Krajicek, Jan
Publicado: (2023)