The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper presents three results on the power of two-prover one-round interactive proof systems based on oracularization under the existence of prior entanglement between dishonest provers. It is proved that the two-prover one-round interactive proof system for PSPACE by Cai, Condon, and Lipton [JCSS 48:183-193, 1994] still achieves exponentially small soundness error in the existence of prior entanglement...
Partial Transmit Sequence (PTS) method is a well - known method which can reduce the peak-to-average ratio (PAPR) for an OFDM signal. A major drawback of PTS method is its higher computation complexity due to the necessity of larger number of inverse fast Fourier transforms (IFFT). The PTS method with low computation complexity, called decomposition PTS (D-PTS) sub-blocking was proposed which employs...
A major drawback of partial transmit sequence (PTS) method is its higher computation complexity due to the necessity of larger number of inverse fast Fourier transforms (IFFT). The PTS method with low computation complexity, called decomposition PTS sub-blocking was proposed which employs the radix-r inverse fast Fourier transform (IFFT) for the signals at the middle stages of an N-point radix-r IFFT...
Partial Transmit Sequence (PTS) method is a well - known method which can reduce the peak-to-average ratio (PAPR) for an OFDM signal. A major drawback of PTS method is its higher computation complexity due to the necessity of larger number of inverse fast Fourier transforms (IFFT). The PTS method with low computation complexity, called decomposition PTS sub-blocking was proposed [1] which employs...
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as multi-prover interactive proof systems. This paper develops a new method for proving limits of nonlocal strategies that make use of prior entanglement among players (or, provers, in the terminology of multi-prover interactive...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.