Proceedings 17th IEEE Annual Conference on Computational Complexity
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0769514685

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Improved cryptographic hash functions with worst-case/average-case connection

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004324 ◽

2005 ◽

Author(s):

D. Micciancio

Keyword(s):

Hash Functions ◽

Worst Case ◽

Average Case ◽

Cryptographic Hash Functions

Download Full-text

Resolution lower bounds for the weak pigeonhole principle

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004320 ◽

2005 ◽

Author(s):

Ran Raz

Keyword(s):

Lower Bounds ◽

Pigeonhole Principle

Download Full-text

Pseudo-random generators for all hardnesses

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004326 ◽

2005 ◽

Author(s):

C. Umans

Keyword(s):

Random Generators

Download Full-text

Randomness conductors and constant-degree lossless expanders

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004327 ◽

2005 ◽

Cited By ~ 1

Author(s):

M. Capalbo ◽

O. Reingold ◽

S. Vadhan ◽

A. Wigderson

Keyword(s):

Constant Degree

Download Full-text

Hard examples for bounded depth frege

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004321 ◽

2005 ◽

Cited By ~ 1

Author(s):

E. Ben-Sasson

Download Full-text

Algorithmic derandomization via complexity theory

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004325 ◽

2005 ◽

Cited By ~ 1

Author(s):

D. Sivakumar

Keyword(s):

Complexity Theory

Download Full-text

Algebras of minimal rank over perfect fields

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004346 ◽

2003 ◽

Cited By ~ 1

Author(s):

M. Blaser

Keyword(s):

Minimal Rank

Download Full-text

The complexity of approximating the entropy

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004329 ◽

2003 ◽

Cited By ~ 3

Author(s):

T. Batu ◽

S. Dasgupta ◽

R. Kumar ◽

R. Rubinfeld

Download Full-text

Pseudorandomness and average-case complexity via uniform reductions

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004348 ◽

2003 ◽

Cited By ~ 18

Author(s):

L. Trevisan ◽

S. Vadhan

Keyword(s):

Average Case ◽

Case Complexity ◽

Average Case Complexity

Download Full-text

Sampling short lattice vectors and the closest lattice vector problem

Proceedings 17th IEEE Annual Conference on Computational Complexity ◽

10.1109/ccc.2002.1004339 ◽

2003 ◽

Cited By ~ 19

Author(s):

M. Ajtai ◽

R. Kumar ◽

D. Sivakumar

Keyword(s):

Lattice Vector ◽

Vector Problem

Download Full-text

Proceedings 17th IEEE Annual Conference on Computational ComplexityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

Improved cryptographic hash functions with worst-case/average-case connection

Resolution lower bounds for the weak pigeonhole principle

Pseudo-random generators for all hardnesses

Randomness conductors and constant-degree lossless expanders

Hard examples for bounded depth frege

Algorithmic derandomization via complexity theory

Algebras of minimal rank over perfect fields

The complexity of approximating the entropy

Pseudorandomness and average-case complexity via uniform reductions

Sampling short lattice vectors and the closest lattice vector problem

Proceedings 17th IEEE Annual Conference on Computational Complexity
Latest Publications