相关论文: Pseudopolynomial algorithm for single machine sche…

This paper has been withdrawn due to an error in one of the equations in the extended portion.

We design a Copula-based generic randomized truthful mechanism for scheduling on two unrelated machines with approximation ratio within $[1.5852, 1.58606]$, offering an improved upper bound for the two-machine case. Moreover, we provide an…

This paper has been withdrawn by the author due to some mistakes

This paper studies scheduling coupled tasks with exact delays to minimize maximum lateness. The first task has processing time $p>0$ and the second $b_i\geq 0$, also the second needs to start exactly $p$ units of time after the completion…

Over the past few years, self-attention is shining in the field of deep learning, especially in the domain of natural language processing(NLP). Its impressive effectiveness, along with ubiquitous implementations, have aroused our interest…

This paper has been withdrawn by the author, since one of the key results duplicates existing work, as pointed out by a reader. I am currently revising the manuscript.

We show that for any rational p \in [1,\infty) except p = 1, 2, unless P = NP, there is no polynomial-time algorithm for approximating the matrix p-norm to arbitrary relative precision. We also show that for any rational p\in [1,\infty)…

We study a scheduling problem in which jobs may be split into parts, where the parts of a split job may be processed simultaneously on more than one machine. Each part of a job requires a setup time, however, on the machine where the job…

This paper has been withdrawn by the author due to a crucial sign error in equation 1

We consider a recently introduced fair repetitive scheduling problem involving a set of clients, each asking for their associated job to be daily scheduled on a single machine across a finite planning horizon. The goal is to determine a job…

In the weighted flow-time problem on a single machine, we are given a set of n jobs, where each job has a processing requirement p_j, release date r_j and weight w_j. The goal is to find a preemptive schedule which minimizes the sum of…

A prominent problem in scheduling theory is the weighted flow time problem on one machine. We are given a machine and a set of jobs, each of them characterized by a processing time, a release time, and a weight. The goal is to find a…

We show that the class BPP is in NP and coNP. This paper has been withdrawn by the author because B and B' are probabilistic and nonequalities 10 cannot be checked in polynomial time.

There is a conceptual error in the main argument of this paper (essentially a regularization scheme is changed in the middle of a calculation), and therefore it is withdrawn. Interested readers are instead referred to hep-th/9811137.

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

This paper has been withdrawn.

We propose a very simple preprocessing algorithm for semidefinite programming. Our algorithm inspects the constraints of the problem, deletes redundant rows and columns in the constraints, and reduces the size of the variable matrix. It…

The paper was withdrawn by the author. It contained various errors.

Reason for withdrawal: There is a serious mistake in the calculation of the divisor of the rational section used in the proof of Prop. 2.2.1., and with the correct value the argument does not work.

We give a pseudorandom generator that fools $m$-facet polytopes over $\{0,1\}^n$ with seed length $\mathrm{polylog}(m) \cdot \log n$. The previous best seed length had superlinear dependence on $m$. An immediate consequence is a…