DocumentCode

1632248

Title

Hard examples for bounded depth frege

Author

Ben-Sasson, Eli

Author_Institution

Institute of Computer Science, Hebrew University

fYear

2002

fDate

6/24/1905 12:00:00 AM

Firstpage

2

Lastpage

2

Keywords

Bipartite graph; Calculus; Chromium; Computational complexity; Computer science; Graph theory; Logic; Mathematics; Scholarships; Size measurement;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on

ISSN

1093-0159

Print_ISBN

0-7695-1468-5

Type

conf

DOI

10.1109/CCC.2002.1004321

Filename

1004321