NDLI: On the complexity of circuit satisfiability

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

Spectral methods for matrices and tensors

Are many small sets explicitly small?

Message passing algorithms: a success looking for theoreticians

Perfect matchings in o(n log n) time in regular bipartite graphs

How to compress interactive communication

Load balancing and orientability thresholds for random hypergraphs

A full characterization of quantum advice

Public-key cryptography from different assumptions

Detecting high log-densities: an $O(n^{¼})$ approximation for densest k-subgraph

Improving exhaustive search implies superpolynomial lower bounds

Recognizing well-parenthesized expressions in the streaming model

Improved algorithms for computing fisher's market clearing prices: computing fisher's market clearing prices

A sparse Johnson: Lindenstrauss transform

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

Budget constrained auctions with heterogeneous items

On the list-decodability of random linear codes

The limits of buffering: a tight lower bound for dynamic membership in the external memory model

The HOM problem is decidable

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials

Augmenting undirected node-connectivity by one

Changing base without losing space

Bilipschitz snowflakes and metrics of negative type

Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in

A shorter proof of the graph minor algorithm: the unique linkage theorem

Graph expansion and the unique games conjecture

Interactive privacy via the median mechanism

Erratum for: on basing one-way functions on NP-hardness

Extensions and limits to vertex sparsification

A strong direct product theorem for disjointness

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

BQP and the polynomial hierarchy

Oblivious RAMs without cryptogrpahic assumptions

Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth

On the complexity of circuit satisfiability

Measuring independence of datasets

Bayesian algorithmic mechanism design

Saving space by algebraization

Sorting under partial information (without the ellipsoid algorithm)

On the searchability of small-world networks with arbitrary underlying structure

Local list-decoding and testing of random linear codes from high error

Maintaining a large matching and a small vertex cover

Complexity theory for operators in analysis

Bounding the average sensitivity and noise sensitivity of polynomial threshold functions

Towards polynomial lower bounds for dynamic problems

Approximations for the isoperimetric and spectral profile of graphs and related parameters

Tensor-rank and lower bounds for arithmetic formulas

Odd cycle packing

On the complexity of #CSP

The price of privately releasing contingency tables and the spectra of random matrices with correlated rows

Subgraph sparsification and nearly optimal ultrasparsifiers

Hardness amplification in proof complexity

The maximum multiflow problems with bounded fractionality

A quantum lovász local lemma

On the round complexity of covert computation

Optimal homologous cycles, total unimodularity, and linear programming

Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses

Zero-one frequency laws

Multi-parameter mechanism design and sequential posted pricing

On the structure of cubic and quartic polynomials

Matroid matching: the power of local search

Almost tight bounds for rumour spreading with conductance

Pseudorandom generators for polynomial threshold functions

Connectivity oracles for failure prone graphs

Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem

An invariance principle for polytopes

An improved LP-based approximation for steiner tree

An optimal ancestry scheme and small universal posets

Weighted geometric set cover via quasi-uniform sampling

Non-commutative circuits and the sum-of-squares problem

On the geometry of differential privacy

Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Privacy amplification with asymptotically optimal entropy loss

Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms

Near-optimal extractors against quantum storage

Efficiency improvements in constructing pseudorandom generators from one-way functions

Approximate sparse recovery: optimizing time and measurements

Distributed computation in dynamic networks

Efficiently learning mixtures of two Gaussians

On the hardness of the noncommutative determinant

Differential privacy under continual observation

Conditional hardness of precedence constrained scheduling on identical machines

On the complexity of circuit satisfiability

Content Provider	ACM Digital Library
Author	Paturi, Ramamohan Pudlak, Pavel
Abstract	In this paper, we are concerned with the exponential complexity of the Circuit Satisfiability (CktSat) problem and more generally with the exponential complexity of NP-complete problems. Over the past 15 years or so, researchers have obtained a number of exponential-time algorithms with improved running times for exactly solving a variety of NP-complete problems. The improvements are typically in the form of better exponents compared to exhaustive search. Our goal is to develop techniques to prove specific lower bounds on the exponents under plausible complexity assumptions. We consider natural, though restricted, algorithmic paradigms and prove upper bounds on the success probability. Our approach has the advantage of clarifying the relative power of various algorithmic paradigms. Our main technique is a success probability amplification technique, called the Exponential Amplification Lemma, which shows that for any f(n,m)-size bounded probabilistic circuit family A that decides CktSat with success probability at least 2-α n for α<1 on inputs which are circuits of size m with n variables, there is another probabilistic circuit family B that decides CktSat with size roughly f(α n, f(n,m)) and success probability about $2^{-α^{2}$ n > 2-α n. In contrast, the standard method for boosting success probability by repeated trials will improve it to (1-(1-2-α $n})^{t})$ (approx t2-α n for t=O(2α n)) using circuits of size about tf(n,m). Using this lemma, we derive tight bounds on the exponent of the success probability for deciding the CktSat problem in a variety of probabilistic computational models under complexity assumptions. For example, we show that the success probability cannot be better than $2^{-n+o(n)}$ for deciding CktSat by probabilistic polynomial size circuits unless CktSat (thereby all of NP) for polynomial size instances can be decided by $2^{n^{μ}}$ size deterministic circuits for some μ <1, which is considered an unlikely event. As another example, we show that probabilistic quasilinear size circuits cannot achieve success probability better than $2^{-n+o(n)}$ unless CktSat (as well as NP) has O(mO(lg lg m)) size deterministic circuits, which is very close to the statement NP ⊆ P/poly, an unlikely scenario.
Starting Page	241
Ending Page	250
Page Count	10
File Format	PDF
ISBN	9781450300506
DOI	10.1145/1806689.1806724
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2010-06-05
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Circuit satisfiability Np-completeness
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