Results 1  10
of
17
Determinant: Combinatorics, Algorithms, and Complexity
, 1997
"... We prove a new combinatorial characterization of the determinant. The characterization yields a simple combinatorial algorithm for computing the determinant. Hitherto, all (known) algorithms for the determinant have been based on linear algebra. Our combinatorial algorithm requires no division, a ..."
Abstract

Cited by 26 (6 self)
 Add to MetaCart
We prove a new combinatorial characterization of the determinant. The characterization yields a simple combinatorial algorithm for computing the determinant. Hitherto, all (known) algorithms for the determinant have been based on linear algebra. Our combinatorial algorithm requires no division, and works over arbitrary commutative rings. It also lends itself to e#cient parallel implementations. It has been known for some time now that the complexity class GapL characterizes the complexity of computing the determinant of matrices over the integers. We present a direct proof of this characterization.
Unambiguity and Fewness for Logarithmic Space
, 1991
"... We consider various types of unambiguity for logarithmic space bounded Turing machines and polynomial time bounded log space auxiliary pushdown automata. In particular, we introduce the notions of (general), reach, and strong unambiguity. We demonstrate that closure under complement of unambiguo ..."
Abstract

Cited by 23 (6 self)
 Add to MetaCart
We consider various types of unambiguity for logarithmic space bounded Turing machines and polynomial time bounded log space auxiliary pushdown automata. In particular, we introduce the notions of (general), reach, and strong unambiguity. We demonstrate that closure under complement of unambiguous classes implies equivalence of unambiguity and "unambiguous fewness". This, as we will show, applies in the cases of reach and strong unambiguity for logspace. Among the many relations we exhibit, we show that the unambiguous linear contextfree languages, which are not known to be contained in LOGSPACE, nevertheless are contained in strongly unambiguous logspace, and, consequently, in LOGDCFL. In fact, this turns out to be the case for all logspace languages with reach unambiguous fewness. In addition, we show that general unambiguity and fewness of logspace classes can be simulated by reach unambiguity and fewness of auxiliary pushdown automata. 1 Introduction Although the pow...
Simulation of PRAM Models on Meshes
 Nordic Journal on Computing, 2(1):51
, 1994
"... We analyze the complexity of simulating a PRAM (parallel random access machine) on a mesh structured distributed memory machine. By utilizing suitable algorithms for randomized hashing, routing in a mesh, and sorting in a mesh, we prove that simulation of a PRAM on p N \Theta p N (or 3 p N \The ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
We analyze the complexity of simulating a PRAM (parallel random access machine) on a mesh structured distributed memory machine. By utilizing suitable algorithms for randomized hashing, routing in a mesh, and sorting in a mesh, we prove that simulation of a PRAM on p N \Theta p N (or 3 p N \Theta 3 p N \Theta 3 p N ) mesh is possible with O( p N ) (respectively O( 3 p N )) delay with high probability and a relatively small constant. Furthermore, with more sophisticated simulations further speedups are achieved; experiments show delays as low as p N + o( p N ) (respectively 3 p N + o( 3 p N )) per N PRAM processors. These simulations compare quite favorably with PRAM simulations on butterfly and hypercube. 1 Introduction PRAM 1 (Parallel Random Access Machine) is an abstract model of computation. It consists of N processors, each of which may have some local memory and registers, and a global shared memory of size m. A step of a PRAM is often seen to consist of...
Advocating Ownership
, 1996
"... . We show the equivalence of deterministic auxiliary pushdown automata to owner write PRAMs in a fairly large setting by proving that DAuxPDATISP \Gamma f O(1) ; log g \Delta and CROWTIPR \Gamma log f; g O(1) \Delta coincide. Such, we provide the first circuit characterizations of depth ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
. We show the equivalence of deterministic auxiliary pushdown automata to owner write PRAMs in a fairly large setting by proving that DAuxPDATISP \Gamma f O(1) ; log g \Delta and CROWTIPR \Gamma log f; g O(1) \Delta coincide. Such, we provide the first circuit characterizations of depth O(log f) for deterministic sequential automata which are f timebounded. 1 Introduction Parallel models provided fruitful extensions to structural complexity theory, a prominent example being the class NC . Ruzzo exhibited the tight connections between alternating Turing machines, auxiliary pushdown automata, and boolean circuits [20]. By results of Stockmeyer and Vishkyn [21] and by the intertwining of the NC hierarchy with the polylogtime hierarchy of EREWPRAMs these relations are also valid for the various types of PRAMs defined by the concurrent and the exclusive read and write feature. In 1986, Dymond and Ruzzo introduced the concept of owner write for PRAMs and showed close conn...
Unambiguous polynomial hierarchies and exponential size
 In Proceedings of the 9th Structure in Complexity Theory Conference
, 1994
"... In the exponential case circuits of bounded depth characterize the polynomial hierachy. Using the notion of an unambiguous circuit we give a uniform framework to relate the various types of unambiguous polynomial hierarchies and to explain their differences. ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
In the exponential case circuits of bounded depth characterize the polynomial hierachy. Using the notion of an unambiguous circuit we give a uniform framework to relate the various types of unambiguous polynomial hierarchies and to explain their differences.
Uniform Circuits and Exclusive Read PRAMs
 In Proc. of the 11th FST&TCS, number 560 in LNCS
, 1991
"... CRCWPRAMs can be characterized in terms of unbounded fanin circuits. We introduce the notion of SELECTgates. Combining this with the concept of an unambiguous circuit we are able to give a circuit equivalent of EREWPRAMs, thus answering an open question of [SV84]. Moreover, circuits with SELE ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
CRCWPRAMs can be characterized in terms of unbounded fanin circuits. We introduce the notion of SELECTgates. Combining this with the concept of an unambiguous circuit we are able to give a circuit equivalent of EREWPRAMs, thus answering an open question of [SV84]. Moreover, circuits with SELECTgates characterize CRCW, CREW, ERCW, and EREWPRAMs in a uniform manner. Introduction Parallel random access machines (PRAMs) and uniform circuit families are very important models in parallel complexity theory. Other important models are alternating Turing machines and auxiliary pushdown automata (see e.g. [Ruz80, Coo85]). NC , the class of efficiently parallel solvable problems, can be characterized in terms of all these models. For the design of efficient parallel algorithms, PRAMs are the most favorite model, while circuits are often used to achieve more theoretical results, such as lower bounds (see e.g. [Has86]). NC is in fact a hierarchy of classes that contains in particula...
Parallel Communicating Grammar Systems with Terminal Transmission
, 2000
"... We introduce a new variant of PC grammar systems, called PC grammar systems with terminal transmission, PCGSTT for short. We show that rightlinear centralized PCGSTT have nice formal language theoretic properties: they are closed under gsm mappings (in particular, under intersection with regular se ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We introduce a new variant of PC grammar systems, called PC grammar systems with terminal transmission, PCGSTT for short. We show that rightlinear centralized PCGSTT have nice formal language theoretic properties: they are closed under gsm mappings (in particular, under intersection with regular sets and under and homomorphisms) and union; a slight variant is, in addition, closed under concatenation and star; their power lies between that of nparallel grammars introduced by Wood and that of matrix languages of index n, and their relation to equal matrix grammars of degree n is discussed. We show that membership for these language classes is complete for NL. In a second part of the paper, we discuss questions concerning grammatical inference of these systems. More precisely, we show that PCGSTT whose component grammars are terminal distinguishable rightlinear, a notion introduced by Radhakrishnan and Nagaraja in [29, 30], are identifiable in the limit if certain data comm...
Parallel Merge Sort on ConcurrentRead OwnerWrite PRAM
"... . This paper discusses a variant of the CREW PRAM model introduced by Dymond and Ruzzo called CROW (Concurrent Read Owner Write) PRAM. in which each global memory location may only be written by its assigned owner processor. We show that CROW PRAMs can sort in O(log n) parallel time using O(n log n) ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. This paper discusses a variant of the CREW PRAM model introduced by Dymond and Ruzzo called CROW (Concurrent Read Owner Write) PRAM. in which each global memory location may only be written by its assigned owner processor. We show that CROW PRAMs can sort in O(log n) parallel time using O(n log n) processors. 1 Introduction The PRAM (Parallel Random Access Machine) model for parallel computation was introduced as "a collection of synchronous processors executing in parallel and communicating via a global shared memory" by Fortune and Wyllie [FW78]. Their model satisfies the CREW (ConcurrentRead, Exclusive Write) convention for accesses to global memory. Dymond and Ruzzo proposed a natural and frequently occurring restriction of the CREW PRAM, called CROW (Concurrent Read OwnerWrite) PRAM machines, for which each global memory location is assigned a unique owner processor and the owner is the only processor allowed to write into that cell throughout the course of a computation [D...
RUSPACE(log n) \subseteq DSPACE(log² n/log log n)
 THE 7TH ANNUAL INTERNATIONAL SYMPOSIUM ON ALGORITHMS AND COMPUTATION (ISAAC’96
, 1998
"... We present a deterministic algorithm running in space O , log n= log log n # solving the connectivity problem on strongly unambiguous graphs. In addition, we presentanO#log n# timebounded algorithm for this problem running on a parallel pointer machine. ..."
Abstract
 Add to MetaCart
We present a deterministic algorithm running in space O , log n= log log n # solving the connectivity problem on strongly unambiguous graphs. In addition, we presentanO#log n# timebounded algorithm for this problem running on a parallel pointer machine.