Matches in SemOpenAlex for { <https://semopenalex.org/work/W2462702417> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W2462702417 abstract "Boolean circuits were introduced in complexity theory to provide a model for parallel computation. A big advantage of studying Boolean circuits is that they can be viewed as simple combinatorial objects and thus allow us to use many algebraic and combinatorial techniques to derive upper and lower bounds on their computational power. The relationship between Boolean circuits and the traditional Turing machine model helps us to translate the bounds obtained for circuits into bounds for the Turing machine model which is otherwise hard to analyze. In this thesis we study the power of certain kinds of uniform constant depth circuits and provide upper and lower bounds.When we talk about Turing machines, the most important resources are time and space. The most important resources in case of Boolean circuits are size and depth. Circuits that have constant depth and polynomial size have been studied intensely in the last decade or so. The class AC$sp0,$ consisting of languages accepted by constant depth, polynomial size circuits that have NOT gates, and unbounded fan-in AND and OR gates is very well understood and good lower bounds are known for it. On the other hand, the class ACC, that consists of languages accepted by constant depth, polynomial size circuits that have NOT gates, and unbounded fan-in AND, OR and MOD$sb{m}$ gates, for various moduli m, is not well understood at all. It is consistent with our knowledge that an ACC circuit family can compute the Satisfiability problem. In this thesis, we prove that we need exponential size to compute the the Permanent function using uniform circuit families that have constant depth and consist of NOT gates, and unbounded fan-in AND, OR and MOD gates. We also show that there are languages in PP and C$sb=$P that cannot be recognized by uniform ACC type circuits of subsubexponential size.We also study the question of finding a strong separation between NP and AC$sp0.$ We show that non-relativizing proof techniques result from any answer to the question Does NP contain sets that are immune to AC$sp0$? It is also shown that P$sp{rm PP}$ contains sets that are immune to ACC and hence to AC$sp0.$Neil Jones introduced logspace reductions as a tool for studying the relative complexity of problems in P. He also introduced a restricted version of logspace reducibility, called logspace bounded rudimentary reductions to study small complexity classes like Dspace(log n). We show that these logspace bounded rudimentary reductions characterize uniform AC$sp0.$" @default.
- W2462702417 created "2016-07-22" @default.
- W2462702417 creator A5011875693 @default.
- W2462702417 date "1993-01-11" @default.
- W2462702417 modified "2023-09-24" @default.
- W2462702417 title "Lower bounds for uniform constant depth circuits" @default.
- W2462702417 hasPublicationYear "1993" @default.
- W2462702417 type Work @default.
- W2462702417 sameAs 2462702417 @default.
- W2462702417 citedByCount "0" @default.
- W2462702417 crossrefType "journal-article" @default.
- W2462702417 hasAuthorship W2462702417A5011875693 @default.
- W2462702417 hasConcept C11413529 @default.
- W2462702417 hasConcept C118615104 @default.
- W2462702417 hasConcept C119599485 @default.
- W2462702417 hasConcept C127413603 @default.
- W2462702417 hasConcept C134146338 @default.
- W2462702417 hasConcept C134306372 @default.
- W2462702417 hasConcept C141796577 @default.
- W2462702417 hasConcept C187455244 @default.
- W2462702417 hasConcept C199360897 @default.
- W2462702417 hasConcept C2777027219 @default.
- W2462702417 hasConcept C29248071 @default.
- W2462702417 hasConcept C311688 @default.
- W2462702417 hasConcept C33923547 @default.
- W2462702417 hasConcept C39637292 @default.
- W2462702417 hasConcept C41008148 @default.
- W2462702417 hasConcept C45374587 @default.
- W2462702417 hasConcept C77553402 @default.
- W2462702417 hasConcept C80444323 @default.
- W2462702417 hasConcept C90119067 @default.
- W2462702417 hasConcept C90702460 @default.
- W2462702417 hasConceptScore W2462702417C11413529 @default.
- W2462702417 hasConceptScore W2462702417C118615104 @default.
- W2462702417 hasConceptScore W2462702417C119599485 @default.
- W2462702417 hasConceptScore W2462702417C127413603 @default.
- W2462702417 hasConceptScore W2462702417C134146338 @default.
- W2462702417 hasConceptScore W2462702417C134306372 @default.
- W2462702417 hasConceptScore W2462702417C141796577 @default.
- W2462702417 hasConceptScore W2462702417C187455244 @default.
- W2462702417 hasConceptScore W2462702417C199360897 @default.
- W2462702417 hasConceptScore W2462702417C2777027219 @default.
- W2462702417 hasConceptScore W2462702417C29248071 @default.
- W2462702417 hasConceptScore W2462702417C311688 @default.
- W2462702417 hasConceptScore W2462702417C33923547 @default.
- W2462702417 hasConceptScore W2462702417C39637292 @default.
- W2462702417 hasConceptScore W2462702417C41008148 @default.
- W2462702417 hasConceptScore W2462702417C45374587 @default.
- W2462702417 hasConceptScore W2462702417C77553402 @default.
- W2462702417 hasConceptScore W2462702417C80444323 @default.
- W2462702417 hasConceptScore W2462702417C90119067 @default.
- W2462702417 hasConceptScore W2462702417C90702460 @default.
- W2462702417 hasLocation W24627024171 @default.
- W2462702417 hasOpenAccess W2462702417 @default.
- W2462702417 hasPrimaryLocation W24627024171 @default.
- W2462702417 hasRelatedWork W1580127749 @default.
- W2462702417 hasRelatedWork W1615793053 @default.
- W2462702417 hasRelatedWork W1966819396 @default.
- W2462702417 hasRelatedWork W1987462672 @default.
- W2462702417 hasRelatedWork W1995725694 @default.
- W2462702417 hasRelatedWork W2070678975 @default.
- W2462702417 hasRelatedWork W2083348414 @default.
- W2462702417 hasRelatedWork W2091641588 @default.
- W2462702417 hasRelatedWork W21453999 @default.
- W2462702417 hasRelatedWork W2157709541 @default.
- W2462702417 hasRelatedWork W2169644995 @default.
- W2462702417 hasRelatedWork W2407347952 @default.
- W2462702417 hasRelatedWork W2465024128 @default.
- W2462702417 hasRelatedWork W2530499902 @default.
- W2462702417 hasRelatedWork W2751668514 @default.
- W2462702417 hasRelatedWork W275231650 @default.
- W2462702417 hasRelatedWork W3037842207 @default.
- W2462702417 hasRelatedWork W3101424970 @default.
- W2462702417 hasRelatedWork W3127071357 @default.
- W2462702417 hasRelatedWork W216420788 @default.
- W2462702417 isParatext "false" @default.
- W2462702417 isRetracted "false" @default.
- W2462702417 magId "2462702417" @default.
- W2462702417 workType "article" @default.