Related papers: BPP is in NP and coNP

This article has been withdrawn because it was submitted twice unintentionally.

Recent B physics results from LEP and SLD are reviewed. In particular, results of B lifetimes, semileptonic B decays, charm counting, CKM matrix elements, and mixing are presented.

This paper has been withdrawn since it contains some discrepancy with othe authers's recent result. We will not post this until this discrepancy is resolved.

A bilevel program is an optimization problem whose constraints involve another optimization problem. This paper studies bilevel polynomial programs (BPPs), i.e., all the functions are polynomials. We reformulate BPPs equivalently as…

This paper has been withdrawn pending discussions

The paper has been withdrawn by the author due to a gap in Proof of Theorem 1.1.

It is well known that the Bernoulli polynomials $\mathbf{B}_n(x)$ have nonintegral coefficients for $n \geq 1$. However, ten cases are known so far in which the derivative $\mathbf{B}'_n(x)$ has only integral coefficients. One may assume…

Assuming that the Permanent polynomial requires algebraic circuits of exponential size, we show that the class VNP does not have efficiently computable equations. In other words, any nonzero polynomial that vanishes on the coefficient…

This paper has been withdrawn by the author due to similarity to Author's other paper

This paper has been withdrawn by the authors, due to an error in the proof of Lemma 3.1.

This paper has been withdrawn by the author. The statement of the Main Theorem but is wrong in general, there have been provided counterexamples. The main theorem only holds conditionally, under the finiteness statement of theorem 2.8.

We show that the problem of deciding whether the vertex set of a graph can be covered with at most two bicliques is in NP$\cap$coNP. We thus almost determine the computational complexity of a problem whose status has remained open for quite…

This paper has been withdrawn, because the result turned out to be well known.

This paper has been withdrawn by the author due to a crucial error in the Proof of Theorem 0.3

The paper was done as an assigned Princeton university project. It is being withdrawn since it needs to be changed and updated substantially.

We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…

In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some…

Our interest is whether two binomial parameters differ, which parameter is larger, and by how much. This apparently simple problem was addressed by Fisher in the 1930's, and has been the subject of many review papers since then. Yet there…

We show that for continuous time dynamical systems described by polynomial differential equations of modest degree (typically equal to three), the following decision problems which arise in numerous areas of systems and control theory…

This paper has been withdrawn by the author, due a critical mistake on page 3.