Back to Results
First PageMeta Content
Complexity classes / Circuit complexity / Pseudorandomness / Computability theory / Advice / Pseudorandom generator / ACC0 / Natural proof / Boolean circuit / Theoretical computer science / Computational complexity theory / Applied mathematics


The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data∗ Brynmor Chapman† Stanford University
Add to Reading List

Document Date: 2014-12-10 16:56:25

Open Document

File Size: 188,94 KB

Share Result on Facebook

Company

Goldman / /

Currency

pence / /

/

IndustryTerm

circuits computing functions / computing / complexity-theoretic applications / software testing / given algorithm / /

Organization

National Science Foundation / Stanford University / /

Person

Young / Ryan Williams / /

Position

author / input player / circuit player / row player and column player / row player / column player / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

C / L / /

ProvinceOrState

Oregon / /

SportsLeague

Stanford University / /

Technology

cryptography / s/n / given algorithm / time algorithm / /

SocialTag