Imagen de Portada

On Randomized Computational Models and Complexity Classes: a Historical Overview

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Antonelli, Melissa, Lago, Ugo Dal, Pistone, Paolo
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On The Metric Nature of (Differential) Logical Relations
por: Lago, Ugo Dal, et al.
Publicado: (2025)

On the Metric Nature of (Differential) Logical Relations
por: Lago, Ugo Dal, et al.
Publicado: (2026)

Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
por: Chardonnet, Kostia, et al.
Publicado: (2026)

On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
por: Lago, Ugo Dal, et al.
Publicado: (2026)

Linearization via Rewriting (Long Version)
por: Lago, Ugo Dal, et al.
Publicado: (2025)

Tropical Mathematics and the Lambda-Calculus II: Tropical Geometry of Probabilistic Programming Languages
por: Barbarossa, Davide, et al.
Publicado: (2025)

Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
por: Colledan, Andrea, et al.
Publicado: (2024)

Multi types and reasonable space
por: Accattoli, Beniamino, et al.
Publicado: (2022)

Reasonable Space for the $λ$-Calculus, Logarithmically
por: Accattoli, Beniamino, et al.
Publicado: (2022)

A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
por: Baillot, Patrick, et al.
Publicado: (2024)

The Lambda Calculus is Quantifiable
por: Maestracci, Valentin, et al.
Publicado: (2024)

Characterizing Small Circuit Classes from FAC^0 to FAC^1 via Discrete Ordinary Differential Equations
por: Antonelli, Melissa, et al.
Publicado: (2025)

A Linear Temporal Logic of Frequencies on Series of Events
por: Antonelli, Melissa, et al.
Publicado: (2026)

On the Complexity of Proving Polyhedral Reductions
por: Amat, Nicolas, et al.
Publicado: (2023)

Meta-Mathematics of Computational Complexity Theory
por: Oliveira, Igor C.
Publicado: (2025)

Towards a Computational Quantum Logic: An Overview of an Ongoing Research Program
por: Díaz-Caro, Alejandro
Publicado: (2025)

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
por: De Mol, Liesbeth, et al.
Publicado: (2025)

Methods of Class Field Theory to Separate Logics over Finite Residue Classes and Circuit Complexity
por: Arratia, Argimiro, et al.
Publicado: (2015)

Computation and Complexity of Preference Inference Based on Hierarchical Models
por: Wilson, Nic, et al.
Publicado: (2024)

Simple Classes of Automatic Structures
por: Blumensath, Achim
Publicado: (2025)

Counting Worlds Branching Time Semantics for post-hoc Bias Mitigation in generative AI
por: Buda, Alessandro G., et al.
Publicado: (2026)

Computational Complexity of Standpoint LTL
por: Demri, Stéphane, et al.
Publicado: (2024)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
por: Grilletti, Gianluca, et al.
Publicado: (2024)

$Π_{2}$-Rule Systems and Inductive Classes of Gödel Algebras
por: Almeida, Rodrigo Nicolau
Publicado: (2023)

Overview and Roadmap of Team Automata
por: ter Beek, Maurice H., et al.
Publicado: (2025)

Cyclic Implicit Complexity
por: Curzi, Gianluca, et al.
Publicado: (2021)

The Complexity of the Constructive Master Modality
por: Santiago-Fernández, Sofía, et al.
Publicado: (2026)

Bridging Computational Notions of Depth
por: Bienvenu, Laurent, et al.
Publicado: (2024)

Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
por: Pshenitsyn, Tikhon
Publicado: (2023)

Logics and Type Theory: essays dedicated to Stefano Berardi on the occasion of his 1000000th birthday
por: Altenkirch, Thorsten, et al.
Publicado: (2026)

Dynamic Probability Logic: Decidability & Computability
por: Chopoghloo, Somayeh, et al.
Publicado: (2024)

Fixed Point Theorems in Computability Theory
por: Terwijn, Sebastiaan A.
Publicado: (2024)

A Comprehensive Overview of the Lebesgue Differentiation Theorem in Coq
por: Affeldt, Reynald, et al.
Publicado: (2024)

Proof Complexity of Linear Logics
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2026)

Computing with Infinite Objects: the Gray Code Case
por: Spreen, Dieter, et al.
Publicado: (2021)

Developing a Dataset-Adaptive, Normalized Metric for Machine Learning Model Assessment: Integrating Size, Complexity, and Class Imbalance
por: Ossenov, Serzhan
Publicado: (2024)

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes
por: Schirrmacher, Nicole, et al.
Publicado: (2023)

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
por: Amat, Nicolas, et al.
Publicado: (2024)

Computing Supported Models via Transformation to Stable Models
por: Li, Fang, et al.
Publicado: (2025)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
por: Fuchser, Janne, et al.
Publicado: (2025)