Cover Image

Formalizing the notions of non-interactive and interactive algorithms

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Middelburg, C. A.
Format:	Preprint
Published:	2024
Subjects:	Computational Complexity Data Structures and Algorithms Logic in Computer Science F.1.1; F.1.2; F.2.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the formalization of the notion of a concurrent algorithm
by: Middelburg, C. A.
Published: (2024)

On the formalization of the notion of an algorithm
by: Middelburg, C. A.
Published: (2024)

Imperative process algebra and models of computation
by: Middelburg, C. A.
Published: (2022)

Probabilistic Shoenfield Machines
by: Bujok, Maksymilian, et al.
Published: (2024)

On the Length of Strongly Monotone Descending Chains over $\mathbb{N}^d$
by: Schmitz, Sylvain, et al.
Published: (2023)

Online Paging with Heterogeneous Cache Slots
by: Chrobak, Marek, et al.
Published: (2022)

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)

I/O complexity and pebble games with partial computations
by: Sobczyk, Aleksandros
Published: (2024)

Structure-Guided Automated Reasoning
by: Bannach, Max, et al.
Published: (2023)

Constructibility and the P versus NP problem
by: Hole, Arne
Published: (2024)

Neural networks as fuzzy logic formulas
by: Heiman, Damian, et al.
Published: (2026)

An efficient algorithm to compute the minimum free energy of interacting nucleic acid strands
by: Shalaby, Ahmed, et al.
Published: (2024)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
by: Saha, Barna, et al.
Published: (2024)

Certificate-Sensitive Subset Sum: Realizing Instance Complexity
by: Salas, Jesus
Published: (2025)

Fair Vertex Problems Parameterized by Cluster Vertex Deletion
by: Masařík, Tomáš, et al.
Published: (2025)

On the existence of strong proof complexity generators
by: Krajicek, Jan
Published: (2022)

$\rm P$ has polynomial-time finite-state verifiers
by: Gezer, M. Utkan, et al.
Published: (2023)

An Optimal Randomized Algorithm for Finding the Saddlepoint
by: Dallant, Justin, et al.
Published: (2024)

A Theory for Probabilistic Polynomial-Time Reasoning
by: Chen, Lijie, et al.
Published: (2026)

Logical Characterizations of Recurrent Graph Neural Networks with Reals and Floats
by: Ahvonen, Veeti, et al.
Published: (2024)

Expressive Power of Graph Transformers via Logic
by: Ahvonen, Veeti, et al.
Published: (2025)

Graph neural networks and MSO
by: Ahvonen, Veeti, et al.
Published: (2025)

Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization
by: Ahvonen, Veeti, et al.
Published: (2026)

Complementing an imperative process algebra with a rely/guarantee logic
by: Middelburg, C. A.
Published: (2025)

Probabilistic imperative process algebra
by: Middelburg, C. A.
Published: (2026)

Reactive Synthesis for Expected Impacts
by: Chini, Emanuele, et al.
Published: (2024)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
by: Grochow, Joshua A., et al.
Published: (2021)

Count-Free Weisfeiler--Leman and Group Isomorphism
by: Collins, Nathaniel A., et al.
Published: (2022)

Replicability in High Dimensional Statistics
by: Hopkins, Max, et al.
Published: (2024)

Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
by: Chauhan, Archit, et al.
Published: (2026)

Graded modal logic and counting message passing automata
by: Ahvonen, Veeti, et al.
Published: (2024)

Dormancy-aware timed branching bisimilarity, with an application to communication protocol analysis
by: Middelburg, C. A.
Published: (2021)

On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)

On the Complexity of Neural Computation in Superposition
by: Adler, Micah, et al.
Published: (2024)

When Votes Change and Committees Should (Not)
by: Bredereck, Robert, et al.
Published: (2020)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

A LOCAL View of the Polynomial Hierarchy
by: Reiter, Fabian
Published: (2023)

Graph-Based Deterministic Polynomial Framwork for NP Problems
by: Lee, Changryeol
Published: (2025)

Nonuniform Deterministic Finite Automata over finite algebraic structures
by: Idziak, Paweł M., et al.
Published: (2025)