Expander codes von Sipser, M., Spielman, D.A.

Volltext

Limit on the Speed of Quantum Computation in Determining Parity von Farhi, Edward, Goldstone, Jeffrey, Gutmann, Sam, Sipser, Michael

Volltext

Monotone Separation of Logarithmic Space from Logarithmic Depth von Grigni, M., Sipser, M.

Volltext

Graph bisection algorithms with good average case behavior von BUI, T. N, CHAUDHURI, S, LEIGHTON, F. T, SIPSER, M

Volltext

On the power of multi-prover interactive protocols von Fortnow, Lance, Rompel, John, Sipser, Michael

Volltext

Expanders, randomness, or time versus space von Sipser, Michael

Volltext

Bound on the number of functions that can be distinguished with k quantum queries von Farhi, Edward, Goldstone, Jeffrey, Gutmann, Sam, Sipser, Michael

Volltext

Halting space-bounded computations von Sipser, Michael

Volltext

Expander codes von Sipser, M., Spielman, D.A.

Volltext bestellen

Parity, circuits, and the polynomial-time hierarchy von Furst, Merrick, Saxe, James B., Sipser, Michael

Volltext

Lower bounds on the size of sweeping automata von Sipser, Michael

Volltext

Optimal Constructions of Hybrid Algorithms von Kao, Ming-Yang, Ma, Yuan, Sipser, Michael, Yin, Yiqun

Volltext

Frequency of dizygotic twinning von SIPSER, MICHAEL

Volltext

On relativization and the existence of complete sets von Sipser, Michael

Volltext

Are there interactive protocols for co-NP languages? von Fortnow, Lance, Sipser, Michael

Volltext

Compression and ranking von GOLDBERG, A. V, SIPSER, M

Volltext

Communication complexity von Papadimitriou, Christos H., Sipser, Michael

Volltext

A topological view of some problems in complexity theory von Sipser, Michael

Volltext

On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals von Simons, Barbara, Sipser, Michael

Volltext

Monotone separation of logspace from NC/sup 1 von Grigni, M., Sipser, M.

Volltext bestellen