Back to Results
First PageMeta Content
Complexity classes / Circuit complexity / Computability theory / Mathematical optimization / FO / NP-complete / P versus NP problem / Time complexity / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics


Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur
Add to Reading List

Document Date: 2006-11-19 23:12:18


Open Document

File Size: 293,64 KB

Share Result on Facebook

City

Piscataway / /

Company

3SAT / /

Country

United States / India / /

Currency

JPY / /

/

Facility

Steven Rudich Computer Science Department Carnegie Mellon University / Computer Science Indian Institute of Technology Kanpur / University of Ulm / /

Organization

Carnegie Mellon University / Gap Theorem∗ Manindra Agrawal† Department / National Science Foundation / Computer Science Indian Institute of Technology Kanpur / Rutgers University / University of Ulm / /

Person

Steven Rudich / /

/

Position

vp / /

ProvinceOrState

New Jersey / Oregon / /

Technology

cryptography / /

SocialTag