Imagen de Portada

Collision-resistant hash-shuffles on the reals

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Barmpalias, George, Zhang, Xiaoyan
Formato:	Preprint
Publicado:	2025
Materias:	Logic Computational Complexity Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Computable one-way functions on the reals
por: Barmpalias, George, et al.
Publicado: (2024)

Complexity of inversion of functions on the reals
por: Barmpalias, George, et al.
Publicado: (2024)

Growth and irreducibility in path-incompressible trees
por: Barmpalias, George, et al.
Publicado: (2022)

Compression of enumerations and gain
por: Barmpalias, George, et al.
Publicado: (2023)

Dimensionality and randomness
por: Barmpalias, George, et al.
Publicado: (2024)

Set Theory in the Foundation of Math; Internal Classes and External Sets
por: Levin, Leonid A.
Publicado: (2022)

Measuring Decidability as Related to Busy Beaver Numbers
por: Tandi, Gurpreet, et al.
Publicado: (2026)

Consensus, Inconsistency, Emergence: what's paraconsistency got to do with it?
por: Rocha, Gabriel
Publicado: (2025)

Speedability of computably approximable reals and their approximations
por: Barmpalias, George, et al.
Publicado: (2026)

Non-commutative linear logic fragments with sub-context-free complexity
por: Nishimiya, Yusaku, et al.
Publicado: (2025)

On Middle Grounds for Preference Statements
por: George, Anne-Marie, et al.
Publicado: (2025)

Simulation of Turing machines with analytic discrete ODEs: FPTIME and FPSPACE over the reals characterised with discrete ordinary differential equations
por: Blanc, Manon, et al.
Publicado: (2023)

The Proof Analysis Problem
por: Arteche, Noel, et al.
Publicado: (2025)

Effective Versions of Strong Measure Zero
por: Rayman, Matthew
Publicado: (2025)

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

On the consistency of stronger lower bounds for NEXP
por: Thapen, Neil
Publicado: (2025)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
por: Nechesov, Andrey
Publicado: (2024)

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

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

Proof complexity of positive branching programs
por: Das, Anupam, et al.
Publicado: (2021)

Parallelism and Adaptivity in Student-Teacher Witnessing
por: Ježil, Ondřej, et al.
Publicado: (2026)

The complete classification for quantified equality constraints
por: Zhuk, Dmitriy, et al.
Publicado: (2021)

Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
por: Atserias, Albert, et al.
Publicado: (2024)

$Π_{2}^{P}$ vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
por: Zhuk, Dmitriy
Publicado: (2024)

A Proposed Characterization of p-Simulation Between Theories
por: Monroe, Hunter
Publicado: (2025)

Feasibility of Primality in Bounded Arithmetic
por: Jalali, Raheleh, et al.
Publicado: (2025)

Proof complexity of Mal'tsev CSP
por: Gaysin, Azza
Publicado: (2025)

Proof Complexity and Feasible Interpolation
por: Tabatabai, Amirhossein Akbar
Publicado: (2025)

Structures preserved by primitive actions of $S_ω$
por: Bodirsky, Manuel, et al.
Publicado: (2025)

On $NP \cap coNP$ proof complexity generators
por: Krajicek, Jan
Publicado: (2025)

Toward a Characterization of Simulation Between Arithmetic Theories
por: Monroe, Hunter
Publicado: (2026)

Witnessing Flows in Arithmetic
por: Tabatabai, Amirhossein Akbar
Publicado: (2024)

Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable
por: Mouli, Sasank
Publicado: (2024)

Limits of structures and Total NP Search Problems
por: Ježil, Ondřej
Publicado: (2023)

On the local consequence of modal Product logic: standard completeness and decidability
por: Vidal, Amanda
Publicado: (2023)

Complex solutions of polynomial equations on the unit circle
por: Aslanyan, Vahagn
Publicado: (2024)

The Existential Closedness and Zilber-Pink Conjectures
por: Aslanyan, Vahagn
Publicado: (2024)

Nets-within-Nets through the Lens of Data Nets
por: Di Cosmo, Francesco, et al.
Publicado: (2025)

On Higher Order Busy Beaver Function
por: Cao, Zining
Publicado: (2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
por: Shakiba, Yousef, et al.
Publicado: (2025)