Results 261 to 270 of about 81,769 (307)
Some of the next articles are maybe not open access.
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 +2 more sources
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 +2 more sources
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 +3 more sources
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 +3 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
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 +2 more sources
On the Decomposability of $NC$ and $AC$
SIAM Journal on Computing, 1990It 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, 2014Our 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
[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
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
In The Works: Greenville, SC; Greensboro, NC; Washington, NC; Carrboro, NC; Atlanta, GA
1981Short planning reports from: GREENVILLE, SC: In Greenville, South Carolina the County Planning Commission has developed a creative strategy for controlling future development of a mountain area.; GREENSBORO, NC: The Greensboro, North Carolina Community Development program is realizing some success in a joint historic preservation/neighborhood ...
Kitchen, Claudia +4 more
openaire +1 more source
On NC-real complexity classes for additive circuits and their relations with NC
1994Based on the results of Blum, Shub and Smale [1], Meer [6], Cucker and Matamala [3] and Koiran [4], we develop the study of real computation models restricted to additive operations. More specifically we introduce some complexity classes defined by algebraic circuits and we study their relationships with the real computation model.
Michel Cosnard, Martín Matamala
openaire +1 more source
Achieving a STEP-NC Enabled Advanced NC Programming Environment
2009Modern manufacturing requires a flexible numerical chain of industrial products, in particular the relationships between CAD/CAM solutions and CNC. On longer can CNC controllers restrain their tasks at the execution of inflexible orders and choices made at earlier stages of the numerical chain.
Rauch, Matthieu +2 more
openaire +4 more sources