thumbnail

computational complexity

SCIE-ISI SCOPUS (1991-1996,1998-2023)

  1420-8954

 

 

 

Cơ quản chủ quản:  SPRINGER BASEL AG , Birkhauser Verlag Basel

Lĩnh vực:
Mathematics (miscellaneous)Computational Theory and MathematicsTheoretical Computer ScienceComputational Mathematics

Các bài báo tiêu biểu

On the power of small-depth threshold circuits
Tập 1 Số 2 - Trang 113-129 - 1991
Johan Håstad, Mikael Goldmann
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
- 2006
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
The hardness of approximation: Gap location
- 1994
Erez Petrank
Derandomized graph products
Tập 5 Số 1 - Trang 60-75 - 1995
Noga Alon, Uriel Feige, Avi Wigderson, David Zuckerman
Depth-3 arithmetic circuits over fields of characteristic zero
- 2001
Amir Shpilka, Avi Wigderson
Towards proving strong direct product theorems
- 2003
Ronen Shaltiel
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
- 2007
Luca Trevisan, Salil Vadhan
Perceptrons, PP, and the polynomial hierarchy
- 1994
Richard Beigel
Approximation Resistant Predicates from Pairwise Independence
Tập 18 Số 2 - Trang 249-271 - 2009
Per Austrin, Elchanan Mossel
On the hardness of computing the permanent of random matrices
Tập 6 Số 2 - Trang 101-132 - 1996
Uriel Feige, Carsten Lund