Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
show that strassens matrix multiplication algorithm can be used to multiply square boolean matrices by replacing or by
a circulant is an n times n matrix in which the rth row is the rth cyclic shift of the first row 2 le r le n when n is
consider the design of a bus arbitration sequential circuit for a computer containing four cpus this circuit has four
sketch a data-parallel program that operates on a sorted list of keys and finds the largest number of times that a key
sketch a data-parallel program to find the last record in a linked list where initially each record contains the
the n times n mesh-of-trees network n 2r is formed from a n times n mesh by replacing each linear connection forming a
identify problems that arise in a crossbar network when more than one source wishes to connect to the same destination
show that every algorithm on a linear array to compute the product of an ntimesn matrix and an n-vector requires at
design an algorithm for a linear array of length on that convolves two sequences each of length n in on steps show that
show that if strings over an alphabet a with at least two letters are encoded over a one-letter alphabet a unary
consider the ram of section 841 assume the ram executes t steps describe a turing-machine simulation of this ram that
given a turing machine deterministic or not show that there exists another turing machine with a larger tape alphabet
the class of polynomial-time turing reductions are turing reductions in which the otm runs in time polynomial in the
describe a polynomial-time algorithm to determine whether an instance of circuit sat is a yes instance when the circuit
complete the proof of lemma 8142 by making specific assignments of data to memory locations also provide formulas for
give a definition of a log-space uniform family of prams for which lemma 8141 can be extended to show that the
given an instance of satisfiability namely a set of clauses over a set of literals and values for the variables show
design an algorithm for the p-processor bsp andor logp models for the segmented prefix function given the parameters of
design an algorithm for the p-processor bsp andor logp models to multiply two ntimesn matrices when each matrix entry
show that each computation cycle of a p-processor erew pram can be simulated on a radicp timesradicp mesh in odradicp
consider an n-vertex directed graph in which each vertex knows the address of its parent and the roots have themselves
the goal of the list-ranking problem is to assign a rank to each record in a linked list the rank of a record is its
a design an o1-step crcw pram algorithm to find the maximum element in a listb design an olog log n-step crcw pram
design an algorithm to perform a prefix computation on an radicn timesradicn mesh in 3radicn steps show that no other
let g n t r s be context-free a non-terminal a is self-embedding ifand only if sau for some s u isin t a give a