0022-0000

Journal of Computer and System Sciences (JCSS) - Volume 63, Issue 2 论文列表

本期论文列表
GUEST EDITOR'S FOREWORD

The Communication Complexity of Enumeration, Elimination, and Selection

On the Complexity of Some Problems on Groups Input as Multiplication Tables

Quantum Kolmogorov Complexity

Branching Program Size Is Almost Linear in Formula Size

Easiness Assumptions and Hardness Tests: Trading Time for Zero Error

A Lower Bound for the Shortest Path Problem

Time–Space Tradeoffs for SAT on Nonuniform Machines

Integer Circuit Evaluation Is PSPACE-Complete

Papers to Appear in Forthcoming Issues