Related papers: A limitation on the KPT interpolation
We study the derivational complexity of rewrite systems whose termination is provable in the dependency pair framework using the processors for reduction pairs, dependency graphs, or the subterm criterion. We show that the derivational…
We completely characterize the weak differentiability (or, in other words Gateaux differentiability) of the norm in the spaces of bounded multilinear maps. Also, we obtain a multilinear generalization of the well-known Bhatia-\v{S}emrl…
In this paper we prove some interpolation theorems for the multipliers of the Cauchy- Stiltjes type integrals
We generalize the feasible interpolation theorem for semantic derivations from K.(1997) by allowing randomized protocols (protocols in the sense of K.(1997). We also introduce an extension of the monotone circuit model, monotone circuits…
We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of…
The CMI Millennium "P vs NP Problem" can be resolved e.g. if one shows at least one counterexample to the conjecture "P is equal to NP". A certain class of problems being such counterexamples is formulated. This implies the rejection of the…
In this paper we investigate the existence of model-equivalence reduction between NP-logic systems which are logic systems with model existence problem in NP. It is shown that among all NP-systems with model checking problem in NP, the…
We prove a local limit theorem for Lipschitz continuous observables on a weakly coupled lattice of piecewise expanding interval maps. The core of the paper is a proof that the spectral radii of the Fourier-transfer operators for such a…
In this note, we point out two major errors in the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner [2010]. More precisely, they proved that both problems P|pmtn|sum(Tj) and P|rj, pj = p,…
A new probabilistic technique for establishing the existence of certain regular combinatorial structures has been recentlyintroduced by Kuperberg, Lovett, and Peled (STOC 2012). Using this technique, it can be shown that under certain…
Elaborating on a previous work by Simon et al. [PRL 85, 1783 (2000)] we propose a realizable quantum optical single-photon experiment using standard present day technology, capable of discriminating maximally between the predictions of…
Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Application of the uncertainty principle to conditional measurements is investigated, and found to be valid for measurements on separated sub-systems. In light of this, an apparent violation of the uncertainty principle obtained by Kim and…
Strong refutation of random CSPs is a fundamental question in theoretical computer science that has received particular attention due to the long-standing gap between the information-theoretic limit and the computational limit. This gap is…
This work, shows how propositional resolution can be generalized to obtain a resolution proof system for constrained pseudo-propositional logic (CPPL), which is an extension resulted from inserting the natural numbers with few constraints…
We prove in significant generality the (almost-)representability of the Picard functor when restricted to smooth test schemes. The novelty lies in the fact that we prove such (almost-)representability beyond the proper setting.
To the best of our knowledge this paper is the first attempt to introduce and study polynomial interpolation of the polynomial data given on arbitrary varieties. In the first part of the paper we present results on the solvability of such…
The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick…
We present a simple method based on the stability and duality of the properties of sampling and interpolation, which allows one to substantially simplify the proofs of some classical results.