Related papers: Une liste de probl\`emes

We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.

Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

This is a self-contained set of lecture notes covering various aspects of the theory of open quantum system, at a level appropriate for a one-semester graduate course. The main emphasis is on completely positive maps and master equations,…

Open problems from the 15th Annual ACM Symposium on Computational Geometry.

This document contains a description of several of my papers, including remarks on history and connection with subsequent work. It also contains some new results and conjectures.

In this paper, a survey about recent progress on problems solved using graph amalgamations is presented, along with some new results with complete proofs, and some related open problems.

The aim of the present article is to explore the possibilities of representing positive integers as sums of other positive integers and highlight certain fundamental connections between their multiplicative and additive properties. In…

There are many techniques and tools to prove termination of C programs, but up to now these tools were not very powerful for fully automated termination proofs of programs whose termination depends on recursive data structures like lists.…

This is a survey of topological properties of open, complete nonpositively curved manifolds which may have infinite volume. Topics include topology of ends, restrictions on the fundamental group, as well as a review of known examples.

The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.

This note concerns a search for publications in which one can find statements that explain the concept of an operating system, reasons for introducing operating systems, a formalization of the concept of an operating system or theory about…

This is my working paper on a proposed logical framework for the practice of mathematics, which is paralleled by philosophical considerations and a computer implementation (a variant of Automath). Updated 10/27/2016 with a version from…

We present a program synthesis-oriented dataset consisting of human written problem statements and solutions for these problems. The problem statements were collected via crowdsourcing and the program solutions were extracted from…

These informal notes deal with a number of questions related to sums and integrals in analysis.

This is an introduction to some of the most probabilistic aspects of free probability theory.

Discusses how CoRR was set up and some policy issues involved with setting up such a repository.

This article is concerned with an example of complex planar geometry arising from flat origami challenges. The complexity of solution algorithms is illustrated, depending on the depth of the initial analysis of the problem, starting from…

Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…

We present a list of open questions in mathematical physics. After a historical introduction, a number of problems in a variety of different fields are discussed, with the intention of giving an overall impression of the current status of…