Results 271 to 280 of about 192,292 (306)

High-Contrast Random Composites: Homogenisation Framework and Spectral Convergence. [PDF]

Commun Math Phys
Cherdantsev M, Cherednichenko K, Velčić I.   +2 more
europepmc   +1 more source

Narrow-band asymmetric THz absorbers and polarizers based on impedance-matched, cloaked quasi-BICs in doped Ge microdisk metasurfaces. [PDF]

iScience
Hidalgo-Arteaga L, Pura JL, García-Cámara B, Barreda Á, Sánchez-Gil JA.   +4 more
europepmc   +1 more source

A Uniform Circuit Lower Bound for the Permanent

SIAM Journal on Computing, 1994
We show that uniform families of ACC circuits of subexponential size cannot compute the permanent function. This also implies similar lower bounds for certain sets in PP. This is one of the very few examples of a lower bound in circuit complexity where the uniformity condition is essential; it is still unknown if there is any set in Ntime (2nO(1 ...
Allender, Eric, Gore, Vivek
openaire   +3 more sources

Optimal uniform continuity bound for conditional entropy of classical–quantum states

Quantum Information Processing, 2020
In this short note, I show how a recent result of Alhejji and Smith (A tight uniform continuity bound for equivocation, 2019. arXiv:1909.00787v1) regarding an optimal uniform continuity bound for classical conditional entropy leads to an optimal uniform ...
Mark M Wilde, Wilde Mark M
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Bounds for LPT Schedules on Uniform Processors

SIAM Journal on Computing, 1977
We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.
Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni   +2 more
openaire   +1 more source

Bounds for Multifit Scheduling on Uniform Processors

SIAM Journal on Computing, 1983
The authors examine the nonpreemptive assignment of n independent tasks to a system of m uniform processors with the objective of reducing the makespan, or the time required from the start of execution until all tasks are completed. Since the problem of finding a minimal makespan has been shown to be np-hard, and hence unlikely to permit an efficient ...
Donald K. Friesen, Michael A. Langston
openaire   +1 more source

Uniform Bounds for a Class of Algebraic Mappings

SIAM Journal on Computing, 1979
The computation of residues with respect to a set of given moduli and the Chinese remainder algorithm can be considered a pair of general invertible algebraic mappings. This class of algebraic mappings include the more familiar mappings of evaluation and interpolation as well as forward and inverse fast Fourier transform (FFT).
openaire   +2 more sources