相关论文: The Tale of One-way Functions

Computability theory is traditionally conceived as the theoretical basis of informatics. Nevertheless, numerous proposals transcend computability theory, in particular by emphasizing interaction of modules, or components, parts,…

Hilary Putnam once suggested that "the actual existence of sets as 'intangible objects' suffers... from a generalization of a problem first pointed out by Paul Benacerraf... are sets a kind of function or are functions a sort of set?"…

Some techniques for the use of bitwise operations are described in the article. As an example, an open problem of isomorphism-free generations of combinatorial objects is discussed. An equivalence relation on the set of square binary…

We propose FC, a new logic on words that combines finite model theory with the theory of concatenation - a first-order logic that is based on word equations. Like the theory of concatenation, FC is built around word equations; in contrast…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

We develop and analyse a first-order algorithm for the A-optimal experimental design problem. The problem is first presented as a special case of a parametric family of optimal design problems for which duality results and optimality…

Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…

Functional equations (FE) arise quite naturally in the analysis of stochastic systems of different kinds : queueing and telecommunication networks, random walks, enumeration of planar lattice walks, etc. Frequently, the object is to…

Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…

We dwell on how a definition of a theoretical concept of an operating system, suitable to be incorporated in a mathematical theory of operating systems, could look like. This is considered a valuable preparation for the development of a…

The main features of quantum computing are described in the framework of spin resonance methods. Stress is put on the fact that quantum computing is in itself nothing but a re-interpretation (fruitful indeed) of well-known concepts. The…

In literature, it is common to find problems which require a way to encode a finite set of information into a single data; usually means are used for that. An important generalization of means are the so called Aggregation Functions, with a…

The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…

Density functional theory is usually formulated in terms of the density in configuration space. Functionals of the momentum-space density have also been studied, and yet other densities could be considered. We offer a unified view from a…

The idea of using unfolding as a way of computing a program semantics has been applied successfully to logic programs and has shown itself a powerful tool that provides concrete, implementable results, as its outcome is actually source…

Mathematical Selection is a method in which we select a particular choice from a set of such. It have always been an interesting field of study for mathematicians. Combinatorial optimisation is the practice of selecting the best constituent…

The optimal power flow (OPF) is an optimization model dedicated to the development of computational tools used for the planning and operation of electric power systems (EPS). In this work, based on the polar formulation, an extended convex…

In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…

Given an $n$-ary $k-$valued function $f$, $gap(f)$ denotes the minimal number of essential variables in $f$ which become fictive when identifying any two distinct essential variables in $f$. We particularly solve a problem concerning the…

It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…