Matches in SemOpenAlex for { <https://semopenalex.org/work/W2090871895> ?p ?o ?g. }
Showing items 1 to 85 of
85
with 100 items per page.
- W2090871895 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 α 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 2nμ size deterministic circuits for some μ" @default.
- W2090871895 created "2016-06-24" @default.
- W2090871895 creator A5010390385 @default.
- W2090871895 creator A5064016105 @default.
- W2090871895 date "2010-06-05" @default.
- W2090871895 modified "2023-10-16" @default.
- W2090871895 title "On the complexity of circuit satisfiability" @default.
- W2090871895 cites W1515598460 @default.
- W2090871895 cites W1575411448 @default.
- W2090871895 cites W1852383912 @default.
- W2090871895 cites W1971483538 @default.
- W2090871895 cites W1982687611 @default.
- W2090871895 cites W1985572324 @default.
- W2090871895 cites W1995725694 @default.
- W2090871895 cites W2000956176 @default.
- W2090871895 cites W2001224529 @default.
- W2090871895 cites W2001868457 @default.
- W2090871895 cites W2007200873 @default.
- W2090871895 cites W2014430206 @default.
- W2090871895 cites W2018964411 @default.
- W2090871895 cites W2036185701 @default.
- W2090871895 cites W2040996999 @default.
- W2090871895 cites W2042654457 @default.
- W2090871895 cites W2045326192 @default.
- W2090871895 cites W2045717693 @default.
- W2090871895 cites W2048685209 @default.
- W2090871895 cites W2050689197 @default.
- W2090871895 cites W2073025989 @default.
- W2090871895 cites W2074359677 @default.
- W2090871895 cites W2085938002 @default.
- W2090871895 cites W2090190190 @default.
- W2090871895 cites W2096833188 @default.
- W2090871895 cites W2099474653 @default.
- W2090871895 cites W2124240997 @default.
- W2090871895 cites W2130190334 @default.
- W2090871895 cites W2140270919 @default.
- W2090871895 cites W2162561603 @default.
- W2090871895 cites W2171680292 @default.
- W2090871895 cites W4241017158 @default.
- W2090871895 doi "https://doi.org/10.1145/1806689.1806724" @default.
- W2090871895 hasPublicationYear "2010" @default.
- W2090871895 type Work @default.
- W2090871895 sameAs 2090871895 @default.
- W2090871895 citedByCount "12" @default.
- W2090871895 countsByYear W20908718952012 @default.
- W2090871895 countsByYear W20908718952013 @default.
- W2090871895 countsByYear W20908718952016 @default.
- W2090871895 countsByYear W20908718952019 @default.
- W2090871895 countsByYear W20908718952020 @default.
- W2090871895 crossrefType "proceedings-article" @default.
- W2090871895 hasAuthorship W2090871895A5010390385 @default.
- W2090871895 hasAuthorship W2090871895A5064016105 @default.
- W2090871895 hasConcept C119599485 @default.
- W2090871895 hasConcept C127413603 @default.
- W2090871895 hasConcept C134146338 @default.
- W2090871895 hasConcept C168773769 @default.
- W2090871895 hasConcept C41008148 @default.
- W2090871895 hasConcept C6943359 @default.
- W2090871895 hasConcept C80444323 @default.
- W2090871895 hasConcept C90702460 @default.
- W2090871895 hasConceptScore W2090871895C119599485 @default.
- W2090871895 hasConceptScore W2090871895C127413603 @default.
- W2090871895 hasConceptScore W2090871895C134146338 @default.
- W2090871895 hasConceptScore W2090871895C168773769 @default.
- W2090871895 hasConceptScore W2090871895C41008148 @default.
- W2090871895 hasConceptScore W2090871895C6943359 @default.
- W2090871895 hasConceptScore W2090871895C80444323 @default.
- W2090871895 hasConceptScore W2090871895C90702460 @default.
- W2090871895 hasLocation W20908718951 @default.
- W2090871895 hasOpenAccess W2090871895 @default.
- W2090871895 hasPrimaryLocation W20908718951 @default.
- W2090871895 hasRelatedWork W1486715727 @default.
- W2090871895 hasRelatedWork W1567492448 @default.
- W2090871895 hasRelatedWork W1568496597 @default.
- W2090871895 hasRelatedWork W2090854154 @default.
- W2090871895 hasRelatedWork W2109577721 @default.
- W2090871895 hasRelatedWork W2117005051 @default.
- W2090871895 hasRelatedWork W2396641696 @default.
- W2090871895 hasRelatedWork W2404668260 @default.
- W2090871895 hasRelatedWork W2949268935 @default.
- W2090871895 hasRelatedWork W4312390837 @default.
- W2090871895 isParatext "false" @default.
- W2090871895 isRetracted "false" @default.
- W2090871895 magId "2090871895" @default.
- W2090871895 workType "article" @default.