DOCSLIB.ORG

The Complexity Class Conp

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Complexity Class Conp Outline The complexity class coNP Piotr Wojciechowski1 1Lane Department of Computer Science and Electrical Engineering West Virginia University Wojciechowski coNP Outline Outline 1 Description of coNP and examples of problems What is coNP Examples of problems in coNP 2 The NP \ coNP complexity class Properties of NP \ coNP Problems in NP \ coNP 3 NP, coNP, and P The P, NP, coNP Hierarchy Wojciechowski coNP Outline Outline 1 Description of coNP and examples of problems What is coNP Examples of problems in coNP 2 The NP \ coNP complexity class Properties of NP \ coNP Problems in NP \ coNP 3 NP, coNP, and P The P, NP, coNP Hierarchy Wojciechowski coNP Outline Outline 1 Description of coNP and examples of problems What is coNP Examples of problems in coNP 2 The NP \ coNP complexity class Properties of NP \ coNP Problems in NP \ coNP 3 NP, coNP, and P The P, NP, coNP Hierarchy Wojciechowski coNP coNP What is coNP NP \ coNP Examples of problems in coNP NP, coNP, and P Outline 1 Description of coNP and examples of problems What is coNP Examples of problems in coNP 2 The NP \ coNP complexity class Properties of NP \ coNP Problems in NP \ coNP 3 NP, coNP, and P The P, NP, coNP Hierarchy Wojciechowski coNP coNP What is coNP NP \ coNP Examples of problems in coNP NP, coNP, and P coNP as related to NP Definition (coNP) coNP is the complexity class which contains the complements of problems found in NP. Another way of looking at coNP Just as NP can be considered to be the set of problems with succinct ”yes” certificates, coNP can be considered to be the set of problems with succinct ”no” certificates. This means that a ”no” instance of a problem in coNP has a short proof of it being a ”no” instance. Wojciechowski coNP coNP What is coNP NP \ coNP Examples of problems in coNP NP, coNP, and P coNP as related to NP Definition (coNP) coNP is the complexity class which contains the complements of problems found in NP. Another way of looking at coNP Just as NP can be considered to be the set of problems with succinct ”yes” certificates, coNP can be considered to be the set of problems with succinct ”no” certificates. This means that a ”no” instance of a problem in coNP has a short proof of it being a ”no” instance. Wojciechowski coNP coNP What is coNP NP \ coNP Examples of problems in coNP NP, coNP, and P Outline 1 Description of coNP and examples of problems What is coNP Examples of problems in coNP 2 The NP \ coNP complexity class Properties of NP \ coNP Problems in NP \ coNP 3 NP, coNP, and P The P, NP, coNP Hierarchy Wojciechowski coNP coNP What is coNP NP \ coNP Examples of problems in coNP NP, coNP, and P Examples 1 coSAT = fhbi : b is a boolean expression with no satisfying assignmentsg 2 PRIMES = fhpi : p is a prime numberg Wojciechowski coNP coNP What is coNP NP \ coNP Examples of problems in coNP NP, coNP, and P Examples 1 coSAT = fhbi : b is a boolean expression with no satisfying assignmentsg 2 PRIMES = fhpi : p is a prime numberg Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P Outline 1 Description of coNP and examples of problems What is coNP Examples of problems in coNP 2 The NP \ coNP complexity class Properties of NP \ coNP Problems in NP \ coNP 3 NP, coNP, and P The P, NP, coNP Hierarchy Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P Properties Problems have both succinct ”yes” and succinct ”no” certificates. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P Outline 1 Description of coNP and examples of problems What is coNP Examples of problems in coNP 2 The NP \ coNP complexity class Properties of NP \ coNP Problems in NP \ coNP 3 NP, coNP, and P The P, NP, coNP Hierarchy Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P Examples 1 PRIMES 2 All problems in P Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P Examples 1 PRIMES 2 All problems in P Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P PRIMES is in NP \ coNP Goal We first want to develop a different way of determining primality. Want to show that a number p > 1 is prime if and only if there is a number 1 < r < p p−1 such that r p−1 = 1 mod p and r q 6= 1 mod p for all prime divisors q of p − 1. Definition (Relative Primality) Two numbers a and b are relatively prime iff their greatest common divisor, (a; b), is 1. Examples 5 and 234 are relatively prime, 57 and 95 are not, 19 is a common factor. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P PRIMES is in NP \ coNP Goal We first want to develop a different way of determining primality. Want to show that a number p > 1 is prime if and only if there is a number 1 < r < p p−1 such that r p−1 = 1 mod p and r q 6= 1 mod p for all prime divisors q of p − 1. Definition (Relative Primality) Two numbers a and b are relatively prime iff their greatest common divisor, (a; b), is 1. Examples 5 and 234 are relatively prime, 57 and 95 are not, 19 is a common factor. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P PRIMES is in NP \ coNP Goal We first want to develop a different way of determining primality. Want to show that a number p > 1 is prime if and only if there is a number 1 < r < p p−1 such that r p−1 = 1 mod p and r q 6= 1 mod p for all prime divisors q of p − 1. Definition (Relative Primality) Two numbers a and b are relatively prime iff their greatest common divisor, (a; b), is 1. Examples 5 and 234 are relatively prime, 57 and 95 are not, 19 is a common factor. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P PRIMES is in NP \ coNP Goal We first want to develop a different way of determining primality. Want to show that a number p > 1 is prime if and only if there is a number 1 < r < p p−1 such that r p−1 = 1 mod p and r q 6= 1 mod p for all prime divisors q of p − 1. Definition (Relative Primality) Two numbers a and b are relatively prime iff their greatest common divisor, (a; b), is 1. Examples 5 and 234 are relatively prime, 57 and 95 are not, 19 is a common factor. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P An alternate look at primality Definition (Φ(n)) Φ(n) = fm : 1 ≤ m < n; (m; n) = 1g. Definition (Euler φ function) φ(n) = jΦ(n)j and φ(1) = 1. In other words, φ(n) is the number of numbers between 1 and n − 1 which are relatively prime to n Lemma (1) Q 1 φ(n) = n pjn(1 − p ) where p is a prime. Proof. Assume that p1; p2 :::; pk are the prime divisors of n. Observe that each pi knocks off 1 one in every pi candidates for φ(n), leaving n · (1 − ) candidates for φ(n). It therefore pi Q 1 follows that φ(n) = n pjn(1 − p ) where p is a prime. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P An alternate look at primality Definition (Φ(n)) Φ(n) = fm : 1 ≤ m < n; (m; n) = 1g. Definition (Euler φ function) φ(n) = jΦ(n)j and φ(1) = 1. In other words, φ(n) is the number of numbers between 1 and n − 1 which are relatively prime to n Lemma (1) Q 1 φ(n) = n pjn(1 − p ) where p is a prime. Proof. Assume that p1; p2 :::; pk are the prime divisors of n. Observe that each pi knocks off 1 one in every pi candidates for φ(n), leaving n · (1 − ) candidates for φ(n). It therefore pi Q 1 follows that φ(n) = n pjn(1 − p ) where p is a prime. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P An alternate look at primality Definition (Φ(n)) Φ(n) = fm : 1 ≤ m < n; (m; n) = 1g. Definition (Euler φ function) φ(n) = jΦ(n)j and φ(1) = 1. In other words, φ(n) is the number of numbers between 1 and n − 1 which are relatively prime to n Lemma (1) Q 1 φ(n) = n pjn(1 − p ) where p is a prime. Proof. Assume that p1; p2 :::; pk are the prime divisors of n. Observe that each pi knocks off 1 one in every pi candidates for φ(n), leaving n · (1 − ) candidates for φ(n). It therefore pi Q 1 follows that φ(n) = n pjn(1 − p ) where p is a prime. Wojciechowski coNP coNP Properties of NP \ coNP NP \ coNP Problems in NP \ coNP NP, coNP, and P An alternate look at primality Definition (Φ(n)) Φ(n) = fm : 1 ≤ m < n; (m; n) = 1g.
Load more

Recommended publications
  • Complexity Theory Lecture 9 Co-NP Co-NP-Complete
    Complexity Theory 1 Complexity Theory 2 co-NP Complexity Theory Lecture 9 As co-NP is the collection of complements of languages in NP, and P is closed under complementation, co-NP can also be characterised as the collection of languages of the form: ′ L = x y y <p( x ) R (x, y) { |∀ | | | | → } Anuj Dawar University of Cambridge Computer Laboratory NP – the collection of languages with succinct certificates of Easter Term 2010 membership. co-NP – the collection of languages with succinct certificates of http://www.cl.cam.ac.uk/teaching/0910/Complexity/ disqualification. Anuj Dawar May 14, 2010 Anuj Dawar May 14, 2010 Complexity Theory 3 Complexity Theory 4 NP co-NP co-NP-complete P VAL – the collection of Boolean expressions that are valid is co-NP-complete. Any language L that is the complement of an NP-complete language is co-NP-complete. Any of the situations is consistent with our present state of ¯ knowledge: Any reduction of a language L1 to L2 is also a reduction of L1–the complement of L1–to L¯2–the complement of L2. P = NP = co-NP • There is an easy reduction from the complement of SAT to VAL, P = NP co-NP = NP = co-NP • ∩ namely the map that takes an expression to its negation. P = NP co-NP = NP = co-NP • ∩ VAL P P = NP = co-NP ∈ ⇒ P = NP co-NP = NP = co-NP • ∩ VAL NP NP = co-NP ∈ ⇒ Anuj Dawar May 14, 2010 Anuj Dawar May 14, 2010 Complexity Theory 5 Complexity Theory 6 Prime Numbers Primality Consider the decision problem PRIME: Another way of putting this is that Composite is in NP.
    [Show full text]
  • On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs*
    On the Randomness Complexity of Interactive Proofs and Statistical Zero-Knowledge Proofs* Benny Applebaum† Eyal Golombek* Abstract We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, we ask whether it is possible to reduce the randomness complexity, R, of the verifier to be comparable with the number of bits, CV , that the verifier sends during the interaction. We show that such randomness sparsification is possible in several settings. Specifically, unconditional sparsification can be obtained in the non-uniform setting (where the verifier is modelled as a circuit), and in the uniform setting where the parties have access to a (reusable) common-random-string (CRS). We further show that constant-round uniform protocols can be sparsified without a CRS under a plausible worst-case complexity-theoretic assumption that was used previously in the context of derandomization. All the above sparsification results preserve statistical-zero knowledge provided that this property holds against a cheating verifier. We further show that randomness sparsification can be applied to honest-verifier statistical zero-knowledge (HVSZK) proofs at the expense of increasing the communica- tion from the prover by R−F bits, or, in the case of honest-verifier perfect zero-knowledge (HVPZK) by slowing down the simulation by a factor of 2R−F . Here F is a new measure of accessible bit complexity of an HVZK proof system that ranges from 0 to R, where a maximal grade of R is achieved when zero- knowledge holds against a “semi-malicious” verifier that maliciously selects its random tape and then plays honestly.
    [Show full text]
  • EXPSPACE-Hardness of Behavioural Equivalences of Succinct One
    EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets Petr Janˇcar1 Petr Osiˇcka1 Zdenˇek Sawa2 1Dept of Comp. Sci., Faculty of Science, Palack´yUniv. Olomouc, Czech Rep. [email protected], [email protected] 2Dept of Comp. Sci., FEI, Techn. Univ. Ostrava, Czech Rep. [email protected] Abstract We note that the remarkable EXPSPACE-hardness result in [G¨oller, Haase, Ouaknine, Worrell, ICALP 2010] ([GHOW10] for short) allows us to answer an open complexity ques- tion for simulation preorder of succinct one counter nets (i.e., one counter automata with no zero tests where counter increments and decrements are integers written in binary). This problem, as well as bisimulation equivalence, turn out to be EXPSPACE-complete. The technique of [GHOW10] was referred to by Hunter [RP 2015] for deriving EXPSPACE-hardness of reachability games on succinct one-counter nets. We first give a direct self-contained EXPSPACE-hardness proof for such reachability games (by adjust- ing a known PSPACE-hardness proof for emptiness of alternating finite automata with one-letter alphabet); then we reduce reachability games to (bi)simulation games by using a standard “defender-choice” technique. 1 Introduction arXiv:1801.01073v1 [cs.LO] 3 Jan 2018 We concentrate on our contribution, without giving a broader overview of the area here. A remarkable result by G¨oller, Haase, Ouaknine, Worrell [2] shows that model checking a fixed CTL formula on succinct one-counter automata (where counter increments and decre- ments are integers written in binary) is EXPSPACE-hard. Their proof is interesting and nontrivial, and uses two involved results from complexity theory.
    [Show full text]
  • Nitin Saurabh the Institute of Mathematical Sciences, Chennai
    ALGEBRAIC MODELS OF COMPUTATION By Nitin Saurabh The Institute of Mathematical Sciences, Chennai. A thesis submitted to the Board of Studies in Mathematical Sciences In partial fulllment of the requirements For the Degree of Master of Science of HOMI BHABHA NATIONAL INSTITUTE April 2012 CERTIFICATE Certied that the work contained in the thesis entitled Algebraic models of Computation, by Nitin Saurabh, has been carried out under my supervision and that this work has not been submitted elsewhere for a degree. Meena Mahajan Theoretical Computer Science Group The Institute of Mathematical Sciences, Chennai ACKNOWLEDGEMENTS I would like to thank my advisor Prof. Meena Mahajan for her invaluable guidance and continuous support since my undergraduate days. Her expertise and ideas helped me comprehend new techniques. Her guidance during the preparation of this thesis has been invaluable. I also thank her for always being there to discuss and clarify any matter. I am extremely grateful to all the faculty members of theory group at IMSc and CMI for their continuous encouragement and giving me an opportunity to learn from them. I would like to thank all my friends, at IMSc and CMI, for making my stay in Chennai a memorable one. Most of all, I take this opportunity to thank my parents, my uncle and my brother. Abstract Valiant [Val79, Val82] had proposed an analogue of the theory of NP-completeness in an entirely algebraic framework to study the complexity of polynomial families. Artihmetic circuits form the most standard model for studying the complexity of polynomial computations. In a note [Val92], Valiant argued that in order to prove lower bounds for boolean circuits, obtaining lower bounds for arithmetic circuits should be a rst step.
    [Show full text]
  • On the NP-Completeness of the Minimum Circuit Size Problem
    On the NP-Completeness of the Minimum Circuit Size Problem John M. Hitchcock∗ A. Pavany Department of Computer Science Department of Computer Science University of Wyoming Iowa State University Abstract We study the Minimum Circuit Size Problem (MCSP): given the truth-table of a Boolean function f and a number k, does there exist a Boolean circuit of size at most k computing f? This is a fundamental NP problem that is not known to be NP-complete. Previous work has studied consequences of the NP-completeness of MCSP. We extend this work and consider whether MCSP may be complete for NP under more powerful reductions. We also show that NP-completeness of MCSP allows for amplification of circuit complexity. We show the following results. • If MCSP is NP-complete via many-one reductions, the following circuit complexity amplifi- Ω(1) cation result holds: If NP\co-NP requires 2n -size circuits, then ENP requires 2Ω(n)-size circuits. • If MCSP is NP-complete under truth-table reductions, then EXP 6= NP \ SIZE(2n ) for some > 0 and EXP 6= ZPP. This result extends to polylog Turing reductions. 1 Introduction Many natural NP problems are known to be NP-complete. Ladner's theorem [14] tells us that if P is different from NP, then there are NP-intermediate problems: problems that are in NP, not in P, but also not NP-complete. The examples arising out of Ladner's theorem come from diagonalization and are not natural. A canonical candidate example of a natural NP-intermediate problem is the Graph Isomorphism (GI) problem.
    [Show full text]
  • Dspace 6.X Documentation
    DSpace 6.x Documentation DSpace 6.x Documentation Author: The DSpace Developer Team Date: 27 June 2018 URL: https://wiki.duraspace.org/display/DSDOC6x Page 1 of 924 DSpace 6.x Documentation Table of Contents 1 Introduction ___________________________________________________________________________ 7 1.1 Release Notes ____________________________________________________________________ 8 1.1.1 6.3 Release Notes ___________________________________________________________ 8 1.1.2 6.2 Release Notes __________________________________________________________ 11 1.1.3 6.1 Release Notes _________________________________________________________ 12 1.1.4 6.0 Release Notes __________________________________________________________ 14 1.2 Functional Overview _______________________________________________________________ 22 1.2.1 Online access to your digital assets ____________________________________________ 23 1.2.2 Metadata Management ______________________________________________________ 25 1.2.3 Licensing _________________________________________________________________ 27 1.2.4 Persistent URLs and Identifiers _______________________________________________ 28 1.2.5 Getting content into DSpace __________________________________________________ 30 1.2.6 Getting content out of DSpace ________________________________________________ 33 1.2.7 User Management __________________________________________________________ 35 1.2.8 Access Control ____________________________________________________________ 36 1.2.9 Usage Metrics _____________________________________________________________
    [Show full text]
  • The Complexity Zoo
    The Complexity Zoo Scott Aaronson www.ScottAaronson.com LATEX Translation by Chris Bourke [email protected] 417 classes and counting 1 Contents 1 About This Document 3 2 Introductory Essay 4 2.1 Recommended Further Reading ......................... 4 2.2 Other Theory Compendia ............................ 5 2.3 Errors? ....................................... 5 3 Pronunciation Guide 6 4 Complexity Classes 10 5 Special Zoo Exhibit: Classes of Quantum States and Probability Distribu- tions 110 6 Acknowledgements 116 7 Bibliography 117 2 1 About This Document What is this? Well its a PDF version of the website www.ComplexityZoo.com typeset in LATEX using the complexity package. Well, what’s that? The original Complexity Zoo is a website created by Scott Aaronson which contains a (more or less) comprehensive list of Complexity Classes studied in the area of theoretical computer science known as Computa- tional Complexity. I took on the (mostly painless, thank god for regular expressions) task of translating the Zoo’s HTML code to LATEX for two reasons. First, as a regular Zoo patron, I thought, “what better way to honor such an endeavor than to spruce up the cages a bit and typeset them all in beautiful LATEX.” Second, I thought it would be a perfect project to develop complexity, a LATEX pack- age I’ve created that defines commands to typeset (almost) all of the complexity classes you’ll find here (along with some handy options that allow you to conveniently change the fonts with a single option parameters). To get the package, visit my own home page at http://www.cse.unl.edu/~cbourke/.
    [Show full text]
  • University Microfilms International 300 North Zeeb Road Ann Arbor, Michigan 48106 USA St John's Road
    INFORMATION TO USERS This material was produced from a microfilm copy of the original document. While the most advanced technological means to photograph and reproduce this document have been used, the quality is heavily dependant upon the quality of the original submitted. The following explanation of techniques is provided to help you understand markings or patterns which may appear on this reproduction. 1. The sign or "target" for pages apparently lacking from the document photographed is "Missing Page(s)". If it was possible to obtain the missing page(s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting thru an image and duplicating adjacent pages to insure you complete continuity. 2. When an image on the film is obliterated with a large round black mark, it is an indication that the photographer suspected that the copy may have moved during exposure and thus cause a blurred image. You w ill find a good image of the page in the adjacent frame. 3. When a map, drawing or chart, etc., was part of the material being photographed the photographer followed a definite method in "sectioning" the material. It is customary to begin photoing at the upper left hand corner of a large sheet and to continue photoing from left to right in equal sections with a small overlap. If necessary, sectioning is continued again — beginning below the first row and continuing on until complete. 4. The majority of users indicate that the textual content is of greatest value, however, a somewhat higher quality reproduction could be made from "photographs" if essential to the understanding of the dissertation.
    [Show full text]
  • UNIONS of LINES in Fn 1. Introduction the Main Problem We
    UNIONS OF LINES IN F n RICHARD OBERLIN Abstract. We show that if a collection of lines in a vector space over a finite field has \dimension" at least 2(d−1)+β; then its union has \dimension" at least d + β: This is the sharp estimate of its type when no structural assumptions are placed on the collection of lines. We also consider some refinements and extensions of the main result, including estimates for unions of k-planes. 1. Introduction The main problem we will consider here is to give a lower bound for the dimension of the union of a collection of lines in terms of the dimension of the collection of lines, without imposing a structural hy- pothesis on the collection (in contrast to the Kakeya problem where one assumes that the lines are direction-separated, or perhaps satisfy the weaker \Wolff axiom"). Specifically, we are motivated by the following conjecture of D. Ober- lin (hdim denotes Hausdorff dimension). Conjecture 1.1. Suppose d ≥ 1 is an integer, that 0 ≤ β ≤ 1; and that L is a collection of lines in Rn with hdim(L) ≥ 2(d − 1) + β: Then [ (1) hdim( L) ≥ d + β: L2L The bound (1), if true, would be sharp, as one can see by taking L to be the set of lines contained in the d-planes belonging to a β- dimensional family of d-planes. (Furthermore, there is nothing to be gained by taking 1 < β ≤ 2 since the dimension of the set of lines contained in a d + 1-plane is 2(d − 1) + 2.) Standard Fourier-analytic methods show that (1) holds for d = 1, but the conjecture is open for d > 1: As a model problem, one may consider an analogous question where Rn is replaced by a vector space over a finite-field.
    [Show full text]
  • The Correlation Among Software Complexity Metrics with Case Study
    International Journal of Advanced Computer Research (ISSN (print): 2249-7277 ISSN (online): 2277-7970) Volume-4 Number-2 Issue-15 June-2014 The Correlation among Software Complexity Metrics with Case Study Yahya Tashtoush1, Mohammed Al-Maolegi2, Bassam Arkok3 Abstract software product attributes such as functionality, quality, complexity, efficiency, reliability or People demand for software quality is growing maintainability. For example, a higher number of increasingly, thus different scales for the software code lines will lead to greater software complexity are growing fast to handle the quality of software. and so on. The software complexity metric is one of the measurements that use some of the internal The complexity of software effects on maintenance attributes or characteristics of software to know how activities like software testability, reusability, they effect on the software quality. In this paper, we understandability and modifiability. Software cover some of more efficient software complexity complexity is defined as ―the degree to which a metrics such as Cyclomatic complexity, line of code system or component has a design or implementation and Hallstead complexity metric. This paper that is difficult to understand and verify‖ [1]. All the presents their impacts on the software quality. It factors that make program difficult to understand are also discusses and analyzes the correlation between responsible for complexity. So it is necessary to find them. It finally reveals their relation with the measurements for software to reduce the impacts of number of errors using a real dataset as a case the complexity and guarantee the quality at the same study. time as much as possible.
    [Show full text]
  • Collapsing Exact Arithmetic Hierarchies
    Electronic Colloquium on Computational Complexity, Report No. 131 (2013) Collapsing Exact Arithmetic Hierarchies Nikhil Balaji and Samir Datta Chennai Mathematical Institute fnikhil,[email protected] Abstract. We provide a uniform framework for proving the collapse of the hierarchy, NC1(C) for an exact arith- metic class C of polynomial degree. These hierarchies collapses all the way down to the third level of the AC0- 0 hierarchy, AC3(C). Our main collapsing exhibits are the classes 1 1 C 2 fC=NC ; C=L; C=SAC ; C=Pg: 1 1 NC (C=L) and NC (C=P) are already known to collapse [1,18,19]. We reiterate that our contribution is a framework that works for all these hierarchies. Our proof generalizes a proof 0 1 from [8] where it is used to prove the collapse of the AC (C=NC ) hierarchy. It is essentially based on a polynomial degree characterization of each of the base classes. 1 Introduction Collapsing hierarchies has been an important activity for structural complexity theorists through the years [12,21,14,23,18,17,4,11]. We provide a uniform framework for proving the collapse of the NC1 hierarchy over an exact arithmetic class. Using 0 our method, such a hierarchy collapses all the way down to the AC3 closure of the class. 1 1 1 Our main collapsing exhibits are the NC hierarchies over the classes C=NC , C=L, C=SAC , C=P. Two of these 1 1 hierarchies, viz. NC (C=L); NC (C=P), are already known to collapse ([1,19,18]) while a weaker collapse is known 0 1 for a third one viz.
    [Show full text]
  • Dspace 1.8 Documentation
    DSpace 1.8 Documentation DSpace 1.8 Documentation Author: The DSpace Developer Team Date: 03 November 2011 URL: https://wiki.duraspace.org/display/DSDOC18 Page 1 of 621 DSpace 1.8 Documentation Table of Contents 1 Preface _____________________________________________________________________________ 13 1.1 Release Notes ____________________________________________________________________ 13 2 Introduction __________________________________________________________________________ 15 3 Functional Overview ___________________________________________________________________ 17 3.1 Data Model ______________________________________________________________________ 17 3.2 Plugin Manager ___________________________________________________________________ 19 3.3 Metadata ________________________________________________________________________ 19 3.4 Packager Plugins _________________________________________________________________ 20 3.5 Crosswalk Plugins _________________________________________________________________ 21 3.6 E-People and Groups ______________________________________________________________ 21 3.6.1 E-Person __________________________________________________________________ 21 3.6.2 Groups ____________________________________________________________________ 22 3.7 Authentication ____________________________________________________________________ 22 3.8 Authorization _____________________________________________________________________ 22 3.9 Ingest Process and Workflow ________________________________________________________ 24
    [Show full text]