One complexity theorist's view of quantum computing von Fortnow, Lance

Volltext

Prediction and dimension von Fortnow, Lance, Lutz, Jack H.

Volltext

Time–Space Tradeoffs for Satisfiability von Fortnow, Lance

Volltext

GUEST EDITOR'S FOREWORD von Fortnow, Lance

Volltext

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

Volltext

Relativized worlds with an infinite hierarchy von Fortnow, Lance

Volltext

Two Queries von Buhrman, Harry, Fortnow, Lance

Volltext

Separability and one-way functions von Fortnow, Lance, Rogers, John D.

Volltext

Computational identification of operons in microbial genomes von Zheng, Yu, Szustakowski, Joseph D, Fortnow, Lance, Roberts, Richard J, Kasif, Simon

Volltext

Distributionally Hard Languages von Fortnow, L.

Volltext

Distributionally Hard Languages von Fortnow, L., Pavan, A., Selman, A. L.

Volltext

PP Is Closed under Truth-Table Reductions von Fortnow, Lance, Reingold, Nick

Volltext

Algebraic methods for interactive proof systems von LUND, C, FORTNOW, L, KARLOFF, H, NISAN, N

Volltext

Interactive proof systems and alternating time—space complexity von Fortnow, Lance, Lund, Carsten

Volltext

Circuit Lower Bounds à la Kolmogorov von Fortnow, L., Laplante, S.

Volltext

Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability von Fortnow, L.

Volltext

Comparing notions of full derandomization von Fortnow, L.

Volltext bestellen

Testing random variables for independence and identity von Batu, T., Fischer, E., Fortnow, L., Kumar, R., Rubinfeld, R., White, P.

Volltext

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

Volltext

Tolerant versus intolerant testing for Boolean properties von Fischer, E., Fortnow, L.

Volltext