Results 211 to 220 of about 1,995,126 (241)

Permutation groups in NC

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87, 1987
We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G by a list of generators, we find a set of NC-efficient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; finding the center of G; finding a ...
László Babai   +2 more
openaire   +1 more source

RelativizedNC

Mathematical Systems Theory, 1987
This paper introduces a notion of relativized depth for circuit families and discusses issues regarding uniform families of relativized circuits. This allows us to define a version of relativized NC and compare it under various oracles with relativized L, NL, and P. We see that \(NC_ 1\) is properly contaied in L if and only if there exists an oracle A
openaire   +2 more sources

Manual NC plotter

ACM SIGGRAPH 2013 Posters, 2013
Even in todays world where we can touch information very intuitively with a gadget such as an iPhone, it is still interesting to know, actually, how bits are translated to physical matters and vice versa. Printers, for instance, print digital images on actual paper by moving its motors according to electrical signals.
Yuichi Hirose, Hiroya Tanaka
openaire   +1 more source

Regular languages in \(NC\)

J. Comput. Syst. Sci., 1992
The paper deals with the problem of recognition of regular languages by the circuits of certain type. The theory of the syntactic monoid of a regular language is used to present various characterizations of the regular languages in the circuit complexity class \(AC^ 0\). Also an effective procedure for deciding the membership of a regular language in \(
David A. Mix Barrington   +3 more
openaire   +1 more source

On the Decomposability of $NC$ and $AC$

SIAM Journal on Computing, 1990
It is shown for rationale $a, b \geq 1$ that $NC_a ^{NC_b} = NC_{a+b-1}$. As a consequence, if, for some $k \geq 1$ and $\epsilon > 0, NC_k = NC_{k+\epsilon}$, then $NC_k = NC$. A similar development can be applied to circuits with unbounded fan-in. It is seen that $AC_a ^{AC_{b}} = AC_{a+b}, AC_a ^{NC_b} = NC_{a+b}$, and $NC_a ^{AC_b} = AC_{a + b - 1}$
openaire   +1 more source

The Application of NC Simulation in NC Automatic Programming

Advanced Materials Research, 2014
Our country is manufacturing industry power in the world, NC machining is used in mechanical manufacturing industry widesprealy. With the development of manufacturing industry, NC machining strides forward super-speed machining step by step. In order to achieve the machining requirement of speediness and high-precision of complex parts, automatic ...
openaire   +1 more source

Separation of the monotone NC hierarchy

Proceedings 38th Annual Symposium on Foundations of Computer Science, 1999
The class monotone-\(NC^i\) is the class of all functions that can be computed by polynomial-size circuits of depth \(O(\log^in)\) over the monotone base \(\{\wedge,\vee\}\). It is shown that, for all \(i\), monotone-\(NC^i\) is a strict subclass of monotone-\(NC^{i+1}\), and, thus, monotone-\(NC\), the union of the classes monotone-\(NC^i\) over all \(
Ran Raz, Pierre McKenzie
openaire   +2 more sources

Decomposing NC and AC

[1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference, 2003
It is shown that it is possible to decompose any level of NC into components involving lower levels. The results are extended to the class AC. The method presented results in a natural way to provide NC and AC with oracles. >
openaire   +1 more source

Home - About - Disclaimer - Privacy