A polynomial time hierarchy for ZPTime with one bit of advice is proved. That is for any constants a and b such that 1 < a < b, ZPTime[n]/1 ( ZPTime[n]/1. The technique introduced in this paper is very general and gives the same hierarchy for NTime∩coNTime, UTime, MATime, AMTime and BQTime. It also significantly simplifies the previously known proofs of hierarchies for BPTime and RPTime with ad...

We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.

We characterize the collapse of Buss bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general 1nodel theoretical investigations on fragments of bounded arithmetic.

We study the effect of query order on computational power, and show that Pj k—the languages computable via a polynomial-time machine given one query to the jth level of the boolean hierarchy followed by one query to the kth level of the boolean hierarchy—equals Rpj+2k−1-tt(NP) if j is even and k is odd, and equals Rpj+2k-tt(NP) otherwise. Thus, unless the polynomial hierarchy collapses, it hold...

Based on the Nambu 3-bracket and operators of KP hierarchy, we propose generalized Lax equation triple. Under operator constraints, construct KdV hierarchy Boussinesq hierarchy. Moreover, present exact solutions some nonlinear evolution equations.

this study is a contribution to assess the high resolution digital aerial imagery for semi-automatic analysis of tree species identification. to maximize the benefit of such data, the object-based classification was conducted in a mixed forest plantation. two subsets of an ultracam d image were geometrically corrected using aero-triangulation method. some appropriate transformations were perfor...