Remanufacturing is one of the most effective forms recycling economy, and “Trade-in for Remanufacturing” (TIFR) program in China plays an important role development remanufacturing. To understand this new business model remanufacturing, price demand relationship NP RP are examined two periods, considering TIFR subsidy which practice China. Comparing integrated optimization scheme tiered scheme,...

We present mid-infrared imaging at 11.7 μm for the quadruple lens systems, PG1115+080 and B1422+231, using the cooled mid-infrared camera and spectrometer (COMICS) attached on the Subaru telescope. These lensed QSOs are characterized by their anomalous optical and radio flux ratios as obtained for (A1, A2) images of PG1115+080 and (A, B, C) images of B1422+231, respectively, i.e., such flux rat...

It has been shown that global predicate detection in a distributed computation is an NP-complete problem in general. However, polynomial-time predicate detection algorithms exist for some classes of predicates, such as stable predicates, observer-independent predicates, conjunctions of local predicates etc. We show here that, given a class of predicates for which polynomial-time detection algor...

We study the complexity of computing the coefficients of three classical polynomials, namely the chromatic, flow and reliability polynomials of a graph. Each of these is a specialisation of the Tutte polynomial Σtijxy . It is shown that, unless NP = RP , many of the relevant coefficients do not even have good randomised approximation schemes. We consider the quasiorder induced by approximation ...

We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept. We present the following new upper and lower bounds on well-known concept classes: • We show that unless NP = RP, there is no polynomial-time PAC learning algorithm for DNF formulas where the hypothesis is an OR-of-thresholds. Note that as spec...

For any integer k, we prove the existence of a uniquely k-colourable graph of girth at least g on at most k 12(g+1) vertices whose maximal degree is at most 5k 13. From this we deduce that, unless NP=RP, no polynomial time algorithm for k-Colourability on graphs G of girth g(G) log jGj 13 log k and maximum degree (G) 6k 13 can exist. We also study several related problems.

In this paper we examine the theoretical limits on developing algorithms to nd blocking probabilities in a general loss network. We demonstrate that exactly computing the blocking probabilities of a loss network is a #P-complete problem. We also show that a general algorithm for approximating the blocking probabilities is also intractable unless RP=NP, which seems unlikely according to current ...

On account the progress of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast communication. These applications are more important with arrival of mobile IPv6 protocol with mobile receivers and sources. These applications require a multicast routing protocol which has packets arriving at the multicast recep...

The complexity classes PP;BPP and RP are usually de ned via probabilistic Turing machines (PTMs) that have access to a perfect random source. A natural question is this: Do these classes change if the PTMs only have access to an arbitrary semi-random source rather than a perfect random source? The notion of semi-randomness are de ned by Satha and Vazirani in 1984, and this question was rst cons...