Titlebook: Mathematical Foundations of Computer Science 2015; 40th International S Giuseppe F. Italiano,Giovanni Pighizzini,Donald T. Conference proce

幼兒

subordinate

QMA with Subset State Witnesses,lar in the study of the minimum energy of quantum systems. In this paper, we further investigate the class QMA and its related class QCMA by asking what makes quantum witnesses potentially more powerful than classical ones. We provide a definition of a new class, SQMA, where we restrict the possible

INTER

一大塊

Self-Help-Group

Mutual Dimension and Random Sequences,information that is shared by . and .. In this paper we investigate the relationships between mutual dimension and ., which is the algorithmic randomness of two sequences . and . with respect to probability measures that may be dependent on one another. For a restricted but interesting class of coup

開(kāi)玩笑

Optimal Algorithms and a PTAS for Cost-Aware Scheduling,which must be paid in addition to the standard scheduling cost. We study the scheduling objectives of minimizing the makespan and the sum of (weighted) completion times. It is not difficult to derive a polynomial-time algorithm for preemptive scheduling to minimize the makespan on unrelated machines

obstinate

Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases,or .-formulas on . inputs of size ., our algorithm runs in time . for .. We also show the average-case hardness of computing affine extractors using linear-size .-formulas..We also give improved algorithms and lower bounds for formulas over finite unate bases, i.e., bases of functions which are mono

Increment

Giuseppe F. Italiano,Giovanni Pighizzini,Donald T.Includes supplementary material:

Accede

完全