{"schema_version":"source-reader-v1","record":{"source_id":"pnp-williams","versions":[{"work":{"authors":["Ryan Williams"],"kind":"research_paper","publication":"published","publication_note":"Published author exposition or original paper.","ai_role":"not_reported","ai_note":"AI involvement is not reported by this cited source; this is not a claim of its absence.","artifacts":[{"kind":"pdf","title":"Ryan Williams · Non-uniform ACC circuit lower bounds — proof text","url":"https://people.csail.mit.edu/rrw/acc-lbs-ccc.pdf","version":"CCC-2011-author-version","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"91a09d1ea06fab97e26a791010fd4a902d4be30675998e5bd5e9f8bf68389f80"}],"published":{"value":"2011"}},"id":"pnp-williams@CCC-2011-author-version","source_id":"pnp-williams","title":"Ryan Williams · Non-uniform ACC circuit lower bounds","owner":"Ryan Williams","url":"https://people.csail.mit.edu/rrw/acc-lbs-ccc.pdf","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"CCC-2011-author-version","content_sha256":"91a09d1ea06fab97e26a791010fd4a902d4be30675998e5bd5e9f8bf68389f80","update_method":"Manual primary-source check; changes require a new source version and staff publication.","identifier_policy":"Source URL and exact theorem/section locator; no inferred identity merge.","observed_on":"2026-10-10","source_updated_on":null,"rights":"metadata-link","license":"Full-text redistribution rights not asserted","terms_url":"https://people.csail.mit.edu/rrw/acc-lbs-ccc.pdf","attribution":"Ryan Williams","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-nexp-acc:v1","source_version_id":"pnp-williams@CCC-2011-author-version","item_id":"nexp-acc","url":"https://people.csail.mit.edu/rrw/acc-lbs-ccc.pdf","wording":"NEXP is not contained in nonuniform polynomial-size ACC.","wording_kind":"paraphrase","locator":"Abstract and main theorem, p. 1","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-williams@CCC-2011-author-version","available_versions":[{"id":"pnp-williams@CCC-2011-author-version","revision":"CCC-2011-author-version","observed_on":"2026-10-10","title":"Ryan Williams · Non-uniform ACC circuit lower bounds","publication":"published","content_sha256":"91a09d1ea06fab97e26a791010fd4a902d4be30675998e5bd5e9f8bf68389f80","used_in_current_publications":true}],"usages":[{"id":"source-use-66d8a83bce7026044da9","entry_id":"pnp-entry-nexp-acc:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-nexp-acc","version":2,"slug":"pnp-nexp-acc","title":"NEXP has no polynomial-size ACC circuits"},"fragment":"claim-pnp-nexp-acc","assessment":{"id":"pnp-report-nexp-acc:v1","entry_id":"pnp-entry-nexp-acc:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"Nondeterministic exponential time versus restricted nonuniform circuits; not an NP lower bound against unrestricted circuits.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://people.csail.mit.edu/rrw/acc-lbs-ccc.pdf","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-a57a3be5336213642908","entry_id":"pnp-entry-nexp-acc:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"Algorithms yield ACC circuit lower bounds","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-99bd971b6c2f703749b3","entry_id":"pnp-entry-nexp-acc:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-345ddf534d69120837e0","entry_id":"pnp-entry-nexp-acc:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"reading","title":"Read the mathematical argument; inspect its Claim for assessment and scope.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-86f36d5ee444bb9f2f36","entry_id":"pnp-entry-nexp-acc:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"NEXP has no polynomial-size ACC circuits","claim":{"id":"claim-pnp-nexp-acc","version":2,"slug":"pnp-nexp-acc","title":"NEXP has no polynomial-size ACC circuits"},"fragment":"claim-pnp-nexp-acc","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}