English
Related papers

Related papers: Non-Archimedean analysis, T-functions, and cryptog…

200 papers

We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…

Symbolic Computation · Computer Science 2021-06-18 Xavier Caruso , Marc Mezzarobba , Nobuki Takayama , Tristan Vaccon

Let $k$ be a discretely valued non-Archimedean field. We give an explicit description of analytic functions whose norm is bounded by a given real number $r$ on tubes of reduced $k$-analytic spaces associated to special formal schemes (those…

Algebraic Geometry · Mathematics 2017-06-14 Florent Martin , Christian Kappen

We introduce the task of out-of-order membership to a formal language L, where the letters of a word w are revealed one by one in an adversarial order. The length |w| is known in advance, but the content of w is streamed as pairs (i, w[i]),…

Formal Languages and Automata Theory · Computer Science 2026-05-11 Antoine Amarilli , Sebastien Labbe , Charles Paperman

We will cover the basics of several complex variables in 4 lectures: Basic properties of holomorphic functions in several variables, the notion of pseudoconvexity, CR functions and CR geometry, and the $\bar\partial$-problem. The main…

High Energy Physics - Theory · Physics 2024-11-05 Sean N. Curry , Jiří Lebl , Mathieu Giroux , Holmfridur S. Hannesdottir , Sebastian Mizera , Celina Pasiecznik

Theoretical computer science has found fertile ground in many areas of mathematics. The approach has been to consider classical problems through the prism of computational complexity, where the number of basic computational steps taken to…

Cryptography and Security · Computer Science 2007-05-23 Shafi Goldwasser

A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…

Neural and Evolutionary Computing · Computer Science 2007-05-23 A. N. Gorban , N. R. Sumner , A. Y. Zinovyev

In the cryptanalysis of stream ciphers and pseudorandom sequences, the notions of linear, jump, and 2-adic complexity arise naturally to measure the (non)randomness of a given string. We define an isometry K on F_q^\infty that is the…

Information Theory · Computer Science 2016-08-31 Michael Vielhaber

We define an isomorphism between the group of points of a conic and the set of integers modulo a prime equipped with a non-standard product. This product can be efficiently evaluated through the use of R\'edei rational functions. We then…

Information Theory · Computer Science 2016-01-28 Emanuele Bellini , Nadir Murru

This paper contributes to the challenge of learning a function on streamed multimodal data through evaluation. The core of the result of our paper is the combination of two quite different approaches to this problem. One comes from the…

Machine Learning · Computer Science 2019-09-24 Shujian Liao , Terry Lyons , Weixin Yang , Hao Ni

This lecture series is based on joint work in progress with Shaul Barkan, as well as work in progress of the author. The five sections of these notes correspond to the five lectures, but more details have been added. $2$-dimensional…

Category Theory · Mathematics 2025-06-30 Jan Steinebrunner

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Data Structures and Algorithms · Computer Science 2013-04-19 Nikhil R. Devanur , Shaddin Dughmi , Roy Schwartz , Ankit Sharma , Mohit Singh

This thesis details a project to define a fully compositional theory of synchronous sequential circuits built from primitive components, motivated by applying techniques successfully used in programming languages to hardware. The first part…

Logic in Computer Science · Computer Science 2025-02-13 George Kaye

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…

Formal Languages and Automata Theory · Computer Science 2023-04-19 Thomas Colcombet , Gaëtan Douéneau-Tabot , Aliaume Lopez

The rapid evolution of Text-to-Video (T2V) diffusion models has driven remarkable advancements in generating high-quality, temporally coherent videos from natural language descriptions. Despite these achievements, their vulnerability to…

Computer Vision and Pattern Recognition · Computer Science 2026-01-01 Changzhen Li , Yuecong Min , Jie Zhang , Zheng Yuan , Shiguang Shan , Xilin Chen

Algebraic and fast algebraic attacks are power tools to analyze stream ciphers. A class of symmetric Boolean functions with maximum algebraic immunity were found vulnerable to fast algebraic attacks at EUROCRYPT'06. Recently, the notion of…

Cryptography and Security · Computer Science 2016-11-15 Meicheng Liu , Dongdai Lin

Trawl processes are a family of continuous-time, infinitely divisible, stationary processes whose correlation structure is entirely characterized by their so-called trawl function. This paper investigates the problem of estimating…

Probability · Mathematics 2026-03-20 Orimar Sauri

Textual interaction networks (TINs) are an omnipresent data structure used to model the interplay between users and items on e-commerce websites, social networks, etc., where each interaction is associated with a text description.…

Computation and Language · Computer Science 2025-04-08 Hongtao Wang , Renchi Yang , Hewen Wang , Haoran Zheng , Jianliang Xu

Boolean functions with good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may be designed, for instance, by algebraic constructions or…

Neural and Evolutionary Computing · Computer Science 2025-01-31 Claude Carlet , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We present a way to use Topological Data Analysis (TDA) for machine learning tasks on grayscale images. We apply persistent homology to generate a wide range of topological features using a point cloud obtained from an image, its natural…

Machine Learning · Computer Science 2019-10-23 Adélie Garin , Guillaume Tauzin

We have presented some practical consequences on the molecular-dynamics simulations arising from the numerical algorithm published recently in paper Int. J. Mod. Phys. C 16, 413 (2005). The algorithm is not a finite-difference method and…

Exactly Solvable and Integrable Systems · Physics 2015-06-26 B. Brzostowski , M. R. Dudek , B. Grabiec , T. Nadzieja
‹ Prev 1 3 4 5 6 7 10 Next ›