:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Konstantinos Prousalis
Format:	Recurso digital
Language:
Published:	Zenodo 2026
Online Access:	https://doi.org/10.5281/zenodo.19377610
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Quantum String‐Matching Algorithm
by: Konstantinos Prousalis, et al.
Published: (2024)

Modular Counting CSP: Reductions and Algorithms
by: Kazeminia, Amirhossein, et al.
Published: (2025)

Quantum Advantage and CSP Complexity
by: Ciardo, Lorenzo
Published: (2024)

Efficient Algorithms and New Characterizations for CSP Sparsification
by: Khanna, Sanjeev, et al.
Published: (2024)

Classical Simulation of Quantum CSP Strategies
by: Banakh, Demian, et al.
Published: (2025)

Investigating Conversational Agents to Support Secondary School Students Learning CSP
by: Frazier, Matthew, et al.
Published: (2026)

PyCSP3-Scheduling: A Scheduling Extension for PyCSP3
by: Afifi, Sohaib
Published: (2026)

Translating Federated Learning Algorithms in Python into CSP Processes Using ChatGPT
by: Popovic, Miroslav, et al.
Published: (2025)

Simple Power Analysis on Post-Quantum Code Based Cryptosystems
by: Spalas, Konstantinos
Published: (2026)

The Richness of CSP Non-redundancy
by: Brakensiek, Joshua, et al.
Published: (2025)

Varanus: Runtime Verification for CSP
by: Luckcuck, Matt, et al.
Published: (2025)

Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
by: Cai, Jin-Yi, et al.
Published: (2022)

High Frequency Response of Volatile Memristors
by: Messaris, Ioannis, et al.
Published: (2024)

High Frequency Response of Volatile Memristors
by: Ioannis Messaris, et al.
Published: (2024)

The Price of Privacy For Approximating Max-CSP
by: Dharangutte, Prathamesh, et al.
Published: (2026)

A Theory of Spectral CSP Sparsification
by: Khanna, Sanjeev, et al.
Published: (2025)

Proof complexity of Mal'tsev CSP
by: Gaysin, Azza
Published: (2025)

Towards an algebraic approach to the reconfiguration CSP
by: Kimura, Kei
Published: (2025)

SDPs and Robust Satisfiability of Promise CSP
by: Brakensiek, Joshua, et al.
Published: (2022)

Quantum Algorithms for Compositional Text Processing
by: Laakkonen, Tuomas, et al.
Published: (2024)

Strongly Refuting Random CSP without Literals
by: Chan, Siu On, et al.
Published: (2026)

CSP y Bases de Datos Restrictivas
by: R. M. Gasca
Published: (2003)

Near Optimal Hardness of Approximating $k$-CSP
by: Minzer, Dor, et al.
Published: (2025)

Baby PIH: Parameterized Inapproximability of Min CSP
by: Guruswami, Venkatesan, et al.
Published: (2023)

The CSP Dichotomy, the Axiom of Choice, and Cyclic Polymorphisms
by: Kátay, Tamás, et al.
Published: (2023)

Streaming approximation resistance of every ordering CSP
by: Singer, Noah G., et al.
Published: (2021)

Several Models on Qualitative Motion as instances of the CSP
by: Francisco Toledo
Published: (2002)

A CSP approach to Graph Sandwich Problems
by: Bodirsky, Manuel, et al.
Published: (2025)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

Lower Bounds for CSP Hierarchies Through Ideal Reduction
by: Conneryd, Jonas, et al.
Published: (2025)

CSP: A Simulator For Multi-Agent Ranking Competitions
by: Mordo, Tommy, et al.
Published: (2025)

Parameterized Complexity of MinCSP over the Point Algebra
by: Osipov, George, et al.
Published: (2023)

Physical oceanography during AEGAIO cruise CSP01
by: Balopoulos, Efstathios, et al.
Published: (2012)

PyCSP3: Modeling Combinatorial Constrained Problems in Python
by: Lecoutre, Christophe, et al.
Published: (2020)

Dichotomies for \#CSP on graphs that forbid a clique as a minor
by: Meng, Boning, et al.
Published: (2025)

An Analytical Approach to Parallel Repetition via CSP Inverse Theorems
by: Bhangale, Amey, et al.
Published: (2025)

ANALYSIS OF CSP-1 UNDER INFALLIBLE AND FALLIBLE INSPECTION SYSTEMS
by: RODRIGO A. BARBOSA-CORREA
Published: (2014)

CSP aplicados a la diagnosis basada en modelos
by: R. Ceballos
Published: (2003)

Proof complexity of universal algebra in a CSP dichotomy proof
by: Gaysin, Azza
Published: (2024)

Resource-efficient Quantum Algorithms for Selected Hamiltonian Subspace Diagonalization
by: Graves, Vincent, et al.
Published: (2026)