NDLI: The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data

Please wait, while we are loading the content...

Interactive Coding for Multiparty Protocols

Homophily and the Glass Ceiling Effect in Social Networks

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract]

A Multiprover Interactive Proof System for the Local Hamiltonian Problem

Arithmetic Cryptography: Extended Abstract

Uniform Sampling for Matrix Approximation

The Computational Benefit of Correlated Instances

A New Approach to the Sensitivity Conjecture

The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data

Verifiably Truthful Mechanisms

Direct Sum Testing

Sketching Cuts in Graphs and Hypergraphs

Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback

Dynamic Models of Reputation and Competition in Job-Market Matching

Fractal Structures in Adversarial Prediction

Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication

The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults

Relax, No Need to Round: Integrality of Clustering Formulations

Why are Images Smooth?

Standard Simplices and Pluralities are Not the Most Noise Stable

Separation between Estimation and Approximation

Mechanism Design with Strategic Mediators

On Sample-Based Testers

Very Sparse Additive Spanners and Emulators

Simulating Noisy Channel Interaction

Voting with Coarse Beliefs

On Learning Mixture Models for Permutations

Information Causality, Szemerédi-Trotter and Algebraic Variants of CHSH

On the Communication Complexity of Secure Function Evaluation with Long Output

On Multiplicative Weight Updates for Concave and Submodular Function Maximization

A Physically Universal Cellular Automaton

Communication with Imperfectly Shared Randomness

Deterministic Extractors for Additive Sources: Extended Abstract

Accuracy for Sale: Aggregating Data with a Variance Constraint

$L_{p}$ Testing and Learning of Discrete Distributions

Monotone Properties of k-Uniform Hypergraphs are Weakly Evasive

Deterministic Rateless Codes for BSC

Complex Contagions in Kleinberg's Small World Model

Restricted Distribution Automatizability in PAC-Semantics

Non-Interactive Proofs of Proximity

Privacy-Preserving Public Information for Sequential Games

Robust Hierarchical k-Center Clustering

It'll Probably Work Out: Improved List-Decoding Through Random Operations

Better Outcomes from More Rationality

Sunflowers and Testing Triangle-Freeness of Functions

The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data

Content Provider	ACM Digital Library
Author	Williams, Ryan Chapman, Brynmor
Abstract	We revisit a natural zero-sum game from several prior works. A circuit player, armed with a collection of Boolean circuits, wants to compute a function \$f\$ with one (or some) of its circuits. An input player has a collection of inputs, and wants to find one (or some) inputs on which the circuit player cannot compute f. Several results are known on the existence of small-support strategies for zero-sum games, in particular the above circuit-input game. We give two new applications of these classical results to circuit complexity: Natural properties useful against self-checking circuits are equivalent to circuit lower bounds. We show how the Natural Proofs barrier may be potentially sidestepped, by simply focusing on analyzing circuits that check their answers. Slightly more precisely, we prove NP not concurrent P/poly if and only if there are natural properties that (a) accept the SAT function and (b) are useful against polynomial-size circuits that never err when they report SAT. (Note, via self-reducibility, any small circuit can be turned into one of this kind!) The proof is very general; similar equivalences hold for other lower bound problems. Our message is that one should search for lower bound methods that are designed to succeed (only) against circuits with "one-sided error." Circuit Complexity versus Testing Circuits With Data. We reconsider the problem of program testing, which we formalize as deciding if a given circuit computes a (fixed) function f. We define the "data complexity" of f (as a function of circuit size s) to be the minimum cardinality of a test suite of inputs: a set of input/output pairs necessary and sufficient for deciding if any given circuit of size at most s computes a slice of f. (This is a "gray-box testing" problem, where the value s is side information.) We prove that designing small test suites for f is equivalent to proving circuit lower bounds on f: the data complexity of testing f is "small" if and only if the circuit complexity of f is "large." Therefore, circuit lower bounds may be constructively viewed as data design circuit-testing problems.
Starting Page	263
Ending Page	270
Page Count	8
File Format	PDF
ISBN	9781450333337
DOI	10.1145/2688073.2688115
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-01-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Gray-box testing Circuit-input game Natural proofs Complexity theory Circuit complexity Program testing
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in