DOCSLIB.ORG

Trade-Offs in Distributed Interactive Proofs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Trade-Offs in Distributed Interactive Proofs View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Dagstuhl Research Online Publication Server Trade-Offs in Distributed Interactive Proofs Pierluigi Crescenzi IRIF – CNRS and Université de Paris, France [email protected] Pierre Fraigniaud IRIF – CNRS and Université de Paris, France [email protected] Ami Paz IRIF – CNRS and Université de Paris, France Faculty of Computer Science, University of Vienna, Austria [email protected] Abstract The study of interactive proofs in the context of distributed network computing is a novel topic, recently introduced by Kol, Oshman, and Saxena [PODC 2018]. In the spirit of sequential interactive proofs theory, we study the power of distributed interactive proofs. This is achieved via a series of results establishing trade-offs between various parameters impacting the power of interactive proofs, including the number of interactions, the certificate size, the communication complexity, and the form of randomness used. Our results also connect distributed interactive proofs with the established field of distributed verification. In general, our results contribute to providing structure to the landscape of distributed interactive proofs. 2012 ACM Subject Classification Theory of computation → Distributed computing models; Theory of computation → Interactive proof systems; Theory of computation → Distributed algorithms Keywords and phrases Distributed interactive proofs, Distributed verification Digital Object Identifier 10.4230/LIPIcs.DISC.2019.13 Related Version A full version of the paper is available at https://arxiv.org/abs/1908.03363. Funding Pierre Fraigniaud: Additional support from the INRIA project GANG, and from the ANR project DESCARTES. Ami Paz: Supported by the Fondation des Sciences Mathématiques de Paris. Acknowledgements The authors are thankful to Gianlorenzo D’Angelo for fruitful discussions on the topic of this paper, and to Amir Yehudayoff for discussion on his work [27]. 1 Introduction This paper is concerned with distributed network computing, in which n processing nodes occupy the n vertices of a connected simple graph G, and communicate through the edges of G. In this context, distributed decision [25] refers to the task in which the nodes have to collectively decide whether the network G satisfies some given graph property, which may refer also to input labels given to the nodes (basic examples of such tasks are whether the network is acyclic or whether the network is properly colored). If the property is satisfied then all nodes must accept, otherwise at least one node must reject. Distributed decision finds immediate applications to distributed fault-tolerant computing, in which the nodes must check whether the current network configuration is in a legal state with respect to some Boolean predicate [22]. (If this is not the case, the rejecting node(s) may raise an alarm or launch a recovery procedure.) © Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz; licensed under Creative Commons License CC-BY 33rd International Symposium on Distributed Computing (DISC 2019). Editor: Jukka Suomela; Article No. 13; pp. 13:1–13:17 Leibniz International Proceedings in Informatics Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany 13:2 Trade-Offs in Distributed Interactive Proofs While some properties (e.g., whether a given coloring is proper) are locally decidable (LD) by exchanging information between neighbors only, other properties are not (e.g., whether the network is acyclic, or whether a given set of pointers forms a spanning tree of the network). As a remedy, the notion of proof-labeling scheme (PLS) was introduced [22], and variants were considered, including non-deterministic local decision (NLD) [14], and locally checkable proofs (LCP) [18]. All these settings assume the existence of a prover assigning certificates to the nodes, and a distributed verifier in charge of verifying that these certificates form a distributed proof that the network satisfies some given property. For instance, acyclicness can be certified by a prover picking one arbitrary node u, and assigning to each node v a certificate c(v) equal its distance to u. The distributed verifier running at every node v checks that v has one neighbor w satisfying c(w) = c(v) − 1, and all its other neighbors w0 satisfying c(w0) = c(v) + 1. If the network contains a cycle, then these equalities will be violated in at least one node. Note that the prover is not necessarily an abstract entity, as an algorithm constructing some distributed data structure (e.g., a spanning tree) may construct in parallel a proof that this data structure is correct. Interestingly, all (Turing decidable) graph properties can be certified by PLS and LCP with O(n2)-bits certificates [22], and this is tight [18]– for instance, symmetry1 (Sym) was shown to require Ω(n2)-bit certificates. However, not only such universal certification requires high space complexity at the nodes for storing large certificates, it also requires high communication complexity between neighbors for verifying the correctness of these certificates. Hence, the concern is minimizing the size of the certificates for specific graph properties, e.g., minimum-weight spanning trees (MST) [21]. Recently, the notion of randomized proof-labeling schemes (RPLS) was introduced [15]. RPLS assumes that the distributed verifier is randomized, and the global verdict provided by the nodes about the correctness of the network configuration should hold with probability at least 2/3. Such randomized distributed verification schemes were proven to be very efficient in terms of communication complexity (with O(log n)-bit messages exchanged between neighbors), but this often holds at the cost of actually increasing the size of the certificates provided by the prover. Another recent direction for reducing the certificate size introduces a local hierarchy of complexity classes defined by alternating quantifiers (similarly to the polynomial hierar- chy [28]) for local decision [11]. Interestingly, many properties requiring Ω(n2)-bit certificates with a locally checkable proof stand at the bottom levels of this hierarchy, with O(log n)-bit certificates. This is for instance the case of non 3-colorability (3Col), which stands at the second level of the hierarchy, and Sym, which stands at the third level of the hierarchy. More generally, all monadic second order graph properties belong to this hierarchy with O(log n)-bit certificates. However, it is not clear how to implement the protocols resulting from this hierarchy. Even more recently, a very original and innovative approach was adopted [20, 24], bearing similarities with the local hierarchy but perhaps offering more algorithmic flavor. This approach considers distributed interactive proofs. Such proofs consist of a constant number of interactions between a centralized prover M (a.k.a. Merlin) and a randomized distributed verifier A (a.k.a. Arthur). For instance, a dAM protocol is a protocol with two interactions: Arthur queries Merlin by sending a random string, and Merlin replies to this query by sending a certificate. Similarly, a dMAM protocol involves three interactions: Merlin provides a 1 G is symmetric if G has a non trivial automorphism, i.e., a one-to-one mapping from the set of nodes to itself preserving edges, and distinct from the identity map. P. Crescenzi, P. Fraigniaud, and A. Paz 13:3 certificate to Arthur, then Arthur queries Merlin by sending a random string, and finally Merlin replies to Arthur’s query by sending another certificate. This series of interactions is followed by a phase of distributed verification performed between every node and its neighbors, which may be either deterministic or randomized. Although the interactive model seems weaker than the alternation of quantifiers in the local hierarchy, many properties requiring Ω(n2)-bits certificates with a locally checkable proof admit an Arthur-Merlin protocol with small certificates, and very few interactions. For instance, this is the case of Sym that admits a dMAM protocol with O(log n)-bit certificates, and a dAM protocol with O(n log n)-bit certificates [20] (on the other hand, any dAM protocol for Sym requires Ω(log log n)-bit certificates [20]). It is also known that non symmetry (Sym) can be decided by a dAMAM protocol with O(log n)-bit certificates [24]. These results raise several interesting questions, such as: 1. Are there ways to establish trade-offs between space complexity (i.e., the size of the certificates) and communication complexity (i.e., the size of the messages exchanged between nodes)? The dMA protocols [20] as well as the RPLS protocols [15] enable to gain a lot in terms of message complexity, but at the cost of still high space complexity. Would it be possible to compromise between these two complexities? In particular, would it be possible to reduce the certificate size at the cost of increasing the communication complexity? 2. The theory of distributed decision has somehow restricted itself to distributed randomness, in the sense that each node has only access to a private source of random coins. These coins are public to the prover, but remain private to the other nodes. Shared randomness is known to be stronger than private randomness for communication complexity, as witnessed by, e.g., deciding equality [23]. How much shared randomness could help in the context of distributed decision? 3. Last but not least, are there general reduction theorems between Arthur-Merlin classes for trading the number of interactions with the certificate size? In the centralized setting, it is known that AM[k] = AM[2] for any k ≥ 2, but it is not known whether a similar claim holds in the distributed setting [20]. Also, in the centralized setting the Sipser–Lautemann theorem tells us that MA ⊆ Σ2 ∩ Π2 and MA ⊆ AM ⊆ Π2, but it is not known whether the distributed Arthur-Merlin classes stand so low in the local alternating hierarchy too. Our Results In this paper, we study the power of distributed interactive proofs.
Load more

Recommended publications
  • On Uniformity Within NC
    On Uniformity Within NC David A Mix Barrington Neil Immerman HowardStraubing University of Massachusetts University of Massachusetts Boston Col lege Journal of Computer and System Science Abstract In order to study circuit complexity classes within NC in a uniform setting we need a uniformity condition which is more restrictive than those in common use Twosuch conditions stricter than NC uniformity RuCo have app eared in recent research Immermans families of circuits dened by rstorder formulas ImaImb and a unifor mity corresp onding to Buss deterministic logtime reductions Bu We show that these two notions are equivalent leading to a natural notion of uniformity for lowlevel circuit complexity classes Weshow that recent results on the structure of NC Ba still hold true in this very uniform setting Finallyweinvestigate a parallel notion of uniformity still more restrictive based on the regular languages Here we givecharacterizations of sub classes of the regular languages based on their logical expressibility extending recentwork of Straubing Therien and Thomas STT A preliminary version of this work app eared as BIS Intro duction Circuit Complexity Computer scientists have long tried to classify problems dened as Bo olean predicates or functions by the size or depth of Bo olean circuits needed to solve them This eort has Former name David A Barrington Supp orted by NSF grant CCR Mailing address Dept of Computer and Information Science U of Mass Amherst MA USA Supp orted by NSF grants DCR and CCR Mailing address Dept of
    [Show full text]
  • Two-Way Automata Characterizations of L/Poly Versus NL
    Two-way automata characterizations of L/poly versus NL Christos A. Kapoutsis1;? and Giovanni Pighizzini2 1 LIAFA, Universit´eParis VII, France 2 DICo, Universit`adegli Studi di Milano, Italia Abstract. Let L/poly and NL be the standard complexity classes, of languages recognizable in logarithmic space by Turing machines which are deterministic with polynomially-long advice and nondeterministic without advice, respectively. We recast the question whether L/poly ⊇ NL in terms of deterministic and nondeterministic two-way finite automata (2dfas and 2nfas). We prove it equivalent to the question whether every s-state unary 2nfa has an equivalent poly(s)-state 2dfa, or whether a poly(h)-state 2dfa can check accessibility in h-vertex graphs (even under unary encoding) or check two-way liveness in h-tall, h-column graphs. This complements two recent improvements of an old theorem of Berman and Lingas. On the way, we introduce new types of reductions between regular languages (even unary ones), use them to prove the completeness of specific languages for two-way nondeterministic polynomial size, and propose a purely combinatorial conjecture that implies L/poly + NL. 1 Introduction A prominent open question in complexity theory asks whether nondeterminism is essential in logarithmic-space Turing machines. Formally, this is the question whether L = NL, for L and NL the standard classes of languages recognizable by logarithmic-space deterministic and nondeterministic Turing machines. In the late 70's, Berman and Lingas [1] connected this question to the comparison between deterministic and nondeterministic two-way finite automata (2dfas and 2nfas), proving that if L = NL, then for every s-state σ-symbol 2nfa there is a poly(sσ)-state 2dfa which agrees with it on all inputs of length ≤ s.
    [Show full text]
  • The Boolean Formula Value Problem Is in ALOGTIME (Preliminary Version)
    The Boolean formula value problem is in ALOGTIME (Preliminary Version) Samuel R. Buss¤ Department of Mathematics University of California, Berkeley January 1987 Abstract The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish notation Boolean formulas is also in alternating log time. These results are optimal since the Boolean formula value problem is complete for alternating log time under deterministic log time reductions. Consequently, it is also complete for alternating log time under AC0 reductions. 1. Introduction The Boolean formula value problem is to determine the truth value of a variable-free Boolean formula, or equivalently, to recognize the true Boolean sentences. N. Lynch [11] gave log space algorithms for the Boolean formula value problem and for the more general problem of recognizing a parenthesis context-free grammar. This paper shows that these problems have alternating log time algorithms. This answers the question of Cook [5] of whether the Boolean formula value problem is log space complete | it is not, unless log space and alternating log time are identical. Our results are optimal since, for an appropriately de¯ned notion of log time reductions, the Boolean formula value problem is complete for alternating log time under deterministic log time reductions; consequently, it is also complete for alternating log time under AC0 reductions. It follows that the Boolean formula value problem is not in the log time hierarchy. There are two reasons why the Boolean formula value problem is interesting. First, a Boolean (or propositional) formula is a very fundamental concept ¤Supported in part by an NSF postdoctoral fellowship.
    [Show full text]
  • Relationships Among PL, #L, and the Determinant
    Relationships Among PL, L, and the Determinant y z Eric Allender Mitsunori Ogihara Department of Computer Science Department of Computer Science Hill Center, Busch Campus, P.O. Box 1179 UniversityofRochester Piscataway, NJ 08855-117 9, USA Ro chester, NY 14627 [email protected] [email protected] Abstract Recent results byTo da, Vinay, Damm, and Valianthave shown that the complexity of the determinantischaracterized by the complexity of counting the numb er of accepting compu- tations of a nondeterministic logspace-b ounded machine. This class of functions is known as L. By using that characterization and by establishing a few elementary closure prop erties, we givea very simple pro of of a theorem of Jung, showing that probabilistic logspace-b ounded PL machines lose none of their computational p ower if they are restricted to run in p olynomial time. We also present new results comparing and contrasting the classes of functions reducible to PL, L, and the determinant, using various notions of reducibility. 1 Intro duction One of the most imp ortant and in uential early results of complexity theory is the theorem of [47] showing that the complexity of computing the p ermanentofaninteger matrix is characterized by the complexity class P of functions that count the numb er of accepting computation paths of a nondeterministic p olynomial-time machine. It is p erhaps surprising that well over a decade passed b efore it was discovered that an equally-close connection exists b etween the complexityof computing the determinant of a matrix and the class L de ned in [5] of functions that count the numb er of accepting computation paths of a nondeterministic logspace-b ounded machine.
    [Show full text]
  • On a Theory of Computation and Complexity Over the Real Numbers: Np-Completeness, Recursive Functions and Universal Machines1
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 21, Number 1, July 1989 ON A THEORY OF COMPUTATION AND COMPLEXITY OVER THE REAL NUMBERS: NP-COMPLETENESS, RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES1 LENORE BLUM2, MIKE SHUB AND STEVE SMALE ABSTRACT. We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-complete problems. While our theory reflects the classical over Z (e.g., the computable func­ tions are the recursive functions) it also reflects the special mathematical character of the underlying ring R (e.g., complements of Julia sets provide natural examples of R. E. undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis. Introduction. We develop here some ideas for machines and computa­ tion over the real numbers R. One motivation for this comes from scientific computation. In this use of the computer, a reasonable idealization has the cost of multiplication independent of the size of the number. This contrasts with the usual theoretical computer science picture which takes into account the number of bits of the numbers. Another motivation is to bring the theory of computation into the do­ main of analysis, geometry and topology. The mathematics of these sub­ jects can then be put to use in the systematic analysis of algorithms. On the other hand, there is an extensively developed subject of the theory of discrete computation, which we don't wish to lose in our theory.
    [Show full text]
  • Formal Theories for Linear Algebra
    Formal Theories for Linear Algebra Stephen Cook and Lila Fontes Department of Computer Science, University of Toronto fsacook, [email protected] Abstract. We introduce two-sorted theories in the style of [CN10] for the complexity classes ⊕L and DET , whose complete problems include determinants over Z2 and Z, respectively. We then describe interpreta- tions of Soltys' linear algebra theory LAp over arbitrary integral domains, into each of our new theories. The result shows equivalences of standard theorems of linear algebra over Z2 and Z can be proved in the corre- sponding theory, but leaves open the interesting question of whether the theorems themselves can be proved. 1 Introduction This paper introduces formal theories for the complexity classes ⊕L (also called P arityL) and DET for reasoning about linear algebra over the rings Z2 and Z, respectively. Complete problems for these classes include standard computa- tional problems of linear algebra over their respective rings, such as computing determinants, matrix powers, and coefficients of the characteristic polynomial of a matrix [BDHM92]. (Recently [BKR09] proved that for each k ≥ 1, computing the permanent mod 2k of an integer matrix is in ⊕L, and hence complete.) Each theory allows induction over any relation in the associated complexity class ⊕L or DET , and the functions definable in each theory are the functions in the class. Thus determinants and characteristic polynomials can be defined in the theories, but it is not clear that their standard properties can be proved without defining concepts outside the associated complexity classes. This remains an interesting open question [SK01,SC04].
    [Show full text]
  • Zero-Knowledge Proofs on Secret-Shared Data Via Fully Linear Pcps∗
    Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs∗ Dan Bonehy Elette Boylez Henry Corrigan-Gibbs§ Niv Gilboa{ Yuval Ishaik August 21, 2019 Abstract We introduce and study the notion of fully linear probabilistically checkable proof systems. In such a proof system, the verifier can make a small number of linear queries that apply jointly to the input and a proof vector. Our new type of proof system is motivated by applications in which the input statement is not fully available to any single verifier, but can still be efficiently accessed via linear queries. This situation arises in scenarios where the input is partitioned or secret-shared between two or more parties, or alternatively is encoded using an additively homomorphic encryption or commitment scheme. This setting appears in the context of secure messaging platforms, verifiable outsourced computation, PIR writing, private computation of aggregate statistics, and secure multiparty computation (MPC). In all these applications, there is a need for fully linear proof systems with short proofs. While several efficient constructions of fully linear proof systems are implicit in the interactive proofs literature, many questions about their complexity are open. We present several new constructions of fully linear zero-knowledge proof systems with sublinear proof size for “simple” or “structured” languages. For example, in the non-interactive setting of fully linear PCPs, we n show how to prove that an inputp vector x 2pF , for a finite field F, satisfies a single degree-2 equation with a proof of size O( n) and O( n) linear queries, which we show to be optimal.
    [Show full text]
  • JOE-17-0079.Pdf
    234 3 Y XIE and others Lh and Fsh signaling in 234:3 233–246 Research zebrafish spermatogenesis The highly overlapping actions of Lh signaling and Fsh signaling on zebrafish spermatogenesis Yuxin Xie1, Lianhe Chu1, Yun Liu1, Kathy W Y Sham1, Jianzhen Li1,2 and Correspondence Christopher H K Cheng1 should be addressed 1School of Biomedical Sciences, The Chinese University of Hong Kong-Shandong University Joint Laboratory to J Li or C H K Cheng on Reproductive Genetics, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China Email 2College of Life Sciences, Northwest Normal University, Lanzhou, China [email protected] or [email protected] Abstract Gonadotropin signaling plays a pivotal role in the spermatogenesis of vertebrates, but Key Words exactly how gonadotropins regulate the process in non-mammalian species remains f Fsh elusive. Using a gene knockout approach in zebrafish, we have previously demonstrated f Lh the non-canonical action of gonadotropin signaling on spermatogenesis by analyzing f testis four single mutant lines (lhb, lhr, fshb and fshr) and three double mutant lines (lhb;fshb, f spermatogenesis lhr;fshr and fshb;lhr). In this study, we further investigated the actions of gonadotropins f zebrafish Endocrinology on the testis by establishing three other double-mutant zebrafish lines (lhb;lhr, fshb;fshr of and lhb;fshr). All lhb;lhr and fshb;fshr mutant males were fertile. Analysis on the gonadosomatic index and testicular histology in these lhb;lhr and fshb;fshr mutants Journal demonstrated that Lh signaling and Fsh signaling could functionally compensate each other in the testis.
    [Show full text]
  • Analysis of Quantum Multi-Prover Zero-Knowledge Systems: Elimination of the Honest Condition and Computational Zero-Knowledge Systems for QMIP∗
    Analysis of Quantum Multi-Prover Zero-Knowledge Systems: Elimination of the Honest Condition and Computational Zero-Knowledge Systems for QMIP∗ Yusuke Kinoshita ∗ March 1, 2019 Abstract Zero-knowledge and multi-prover systems are both central notions in classical and quantum complexity theory. There is, however, little research in quantum multi-prover zero-knowledge systems. This paper studies complexity-theoretical aspects of the quantum multi-prover zero-knowledge systems. This paper has two results: • QMIP∗ systems with honest zero-knowledge can be converted into general zero-knowledge systems without any assumptions. • QMIP∗ has computational quantum zero-knowledge systems if a natural computational conjecture holds. One of the main tools is a test (called the GHZ test) that uses GHZ states shared by the provers, which prevents the verifier’s attack in the above two results. Another main tool is what we call the Local Hamiltonian based Interactive protocol (LHI protocol). The LHI protocol makes previous research for Local Hamiltonians applicable to check the history state of interactive proofs, and we then apply Broadbent et al.'s zero-knowledge protocol for QMA [5] to quantum multi-prover systems in order to obtain the second result. arXiv:1902.10851v1 [quant-ph] 28 Feb 2019 ∗Graduate School of Informatics, Nagoya University, Nagoya, Aichi, Japan, [email protected] 1 Introduction 1.1 Background Zero-knowledge systems are interactive proof systems that the prover (with unlimited computational power) can convince the verifier (with polynomial-time computational power) of the correctness of the claim without leakage of information. By \without leakage", we mean that there exists a polynomial-time simulator whose output is indistinguishable from the communication of the interactive proof system.
    [Show full text]
  • In Rats by LH-RH Antagonist Cetrorelix (Suppression of Pituitary-Gonadal Axis/Binding Characteristics/In Vitro Desaturation) GABOR HALMOS*T, ANDREW V
    Proc. Natl. Acad. Sci. USA Vol. 93, pp. 2398-2402, March 1996 Medical Sciences Down-regulation of pituitary receptors for luteinizing hormone-releasing hormone (LH-RH) in rats by LH-RH antagonist Cetrorelix (suppression of pituitary-gonadal axis/binding characteristics/in vitro desaturation) GABOR HALMOS*t, ANDREW V. SCHALLY*tt, JACEK PINSKI*t, MANUEL VADILLO-BUENFILt¶, AND KATE GROOT* *Endocrine, Polypeptide and Cancer Institute, Veterans Affairs Medical Center, New Orleans, LA 70146; and tSection of Experimental Medicine, Department of Medicine, Tulane University School of Medicine, New Orleans, LA 70112 Contributed by Andrew V Schally, December 1, 1995 ABSTRACT Antagonists of luteinizing hormone-releas- in vivo (3, 4, 8, 9). Among these analogs [Ac-D-Nal(2)1,D- ing hormone (LH-RH), unlike the LH-RH agonists, suppress Phe(4C1)2,D-Pal(3)3,D-Cit6,D-Ala'0]LH-RH (SB-75; Cetro- gonadotropins and sex steroid secretion immediately after relix) proved to be the most powerful (9). administration, without initial stimulatory effects. [Ac-D- It is well established that chronic administration of LH-RH Nal(2)1,D-Ph(4C1)2,D-Pal(3)3,D-Cit6,D-Ala"]LH-RH (SB-75; agonists reduces the number of pituitary receptors for LH-RH, Cetrorelix) is a modern, potent antagonistic analog ofLH-RH. a phenomenon that has been called down-regulation, and In this study, the binding characteristics of receptors for induces desensitization of the pituitary gonadotrophs (2-4, 10, LH-RH in membrane fractions from rat anterior pituitaries 11). Although the principal mechanism of action of LH-RH were investigated after a single injection ofCetrorelix at a dose antagonists was thought to be the competitive blockade of of 100 ,ug per rat.
    [Show full text]
  • Product Data Sheet: Dehnguard Modular for North America DG MU 3PH 480 4W+G R (908 349)
    Product Data Sheet: DEHNguard Modular for North America DG MU 3PH 480 4W+G R (908 349) ■ Prewired complete unit without the need for additional overcurrent protection devices ■ High discharge capacity due to heavy-duty zinc oxide varistors (Imax 50 kA 8x20µs) ■ Short circuit current rating (SCCR) 200 kA ■ ANSI/UL 1449 – 4th Ed. Open-Type 1 SPD Figure without obligation Basic circuit diagram DG MU 3PH 480 4W+G R Dimension drawing DG MU 3PH 480 4W+G R DIN rail mount, pluggable surge arrester consisting of a base part and plug-in protection modules for application in 3 Phase High-leg Delta Systems; has floating Form C (SPDT) remote status contacts Type DG MU 3PH 480 4W+G R Part No. 908 349 th SPD classification acc. to ANSI/UL 1449 4 Ed. Open-Type 1 SPD SPD classification acc. to CSA - C22.2 No. 269.1-14 Type 4-1 Component Assembly Nominal System Voltage [L-N] / [H-N] / [L-G] / [H-G] / [L-L] / [L-H] / [N-G] (UN) 240 V a.c. / 416 V a.c. / 240 V a.c. / 416 V a.c. / 480 V a.c. / 480 V a.c. / 0 V a.c. Nominal Power System Frequency 50 / 60 Hz Max. continuous operating voltage AC [L-N] / [H-N] / [L-G] / [H-G] / [L-L] / [L-H] / [N-G] 385 V a.c. / 510 V a.c. / 565 V a.c. / 690 V a.c. / 770 V a.c. / 895 V a.c. / 180 V a.c. Nominal discharge current (8x 20 µs) (In) 20 kA Max.
    [Show full text]
  • Introduction to the Theory of Complexity
    Introduction to the theory of complexity Daniel Pierre Bovet Pierluigi Crescenzi The information in this book is distributed on an “As is” basis, without warranty. Although every precaution has been taken in the preparation of this work, the authors shall not have any liability to any person or entity with respect to any loss or damage caused or alleged to be caused directly or indirectly by the information contained in this work. First electronic edition: June 2006 Contents 1 Mathematical preliminaries 1 1.1 Sets, relations and functions 1 1.2 Set cardinality 5 1.3 Three proof techniques 5 1.4 Graphs 8 1.5 Alphabets, words and languages 10 2 Elements of computability theory 12 2.1 Turing machines 13 2.2 Machines and languages 26 2.3 Reducibility between languages 28 3 Complexity classes 33 3.1 Dynamic complexity measures 34 3.2 Classes of languages 36 3.3 Decision problems and languages 38 3.4 Time-complexity classes 41 3.5 The pseudo-Pascal language 47 4 The class P 51 4.1 The class P 52 4.2 The robustness of the class P 57 4.3 Polynomial-time reducibility 60 4.4 Uniform diagonalization 62 5 The class NP 69 5.1 The class NP 70 5.2 NP-complete languages 72 v vi 5.3 NP-intermediate languages 88 5.4 Computing and verifying a function 92 5.5 Relativization of the P 6= NP conjecture 95 6 The complexity of optimization problems 110 6.1 Optimization problems 111 6.2 Underlying languages 115 6.3 Optimum measure versus optimum solution 117 6.4 Approximability 119 6.5 Reducibility and optimization problems 125 7 Beyond NP 133 7.1 The class coNP
    [Show full text]