|... The theory of computational
|is concerned with measuring the difficulty ...
|... and Freuder have analyzed the time
|Parallel consistent labeling algorithms
Parallel consistent labeling algorithms
Samal, Ashok; Henderson, Tom
|of several constraint satisfaction ...
|... of A may be very great.) Let C(A) be the
|On reliable networks from unreliable gates
On reliable networks from unreliable gates
|of A (i.e. the sum of "costs" of its ...
|... performance parameters that capture the
|On problem transformability in VLSI
On problem transformability in VLSI
Hornick, Scot; Sarrafzadeh, Majid
|of any VLSI chip are the area of the ...
|... which focuses on these two forms of
|Software Complexity Assessment and Human-Machine Interface Evaluation
Software Complexity Assessment and Human-Machine Interface Evaluation
Waguespack, Leslie J., Jr.
|which we term intrinsic and extrinsic ...
|... science, this paper investigates the
|On the complexity of induction of structural descriptions
On the complexity of induction of structural descriptions
|of induction of structural descriptions ...
|... phenomena,” are common place in
|On relativizations with restricted number of accesses to the oracle set
On relativizations with restricted number of accesses to the oracle set
|... The only other algorithm with linear-space
|A linear space algorithm for the LCS problem
A linear space algorithm for the LCS problem
Kumar, S. Kiran; Rangan, C. Pandu
|is by Hirschberg and has runtime ...
|... is shown to be related to communication
|Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
Vazirani, Umesh V.
|theory, leading to a definition of strong ...
|... including its power as measured by the
|Complexity of pattern generation via planar parallel binary fission/fusion grammars
Complexity of pattern generation via planar parallel binary fission/fusion grammars
Carlyle, Jack W.; Greibach, Sheila A.; Paz, Azaria
|of parallel generation of the class of all ...
|... on square initiators and rated in terms of
|Fractal curves and complexity
Fractal curves and complexity
Cutting, James E.; Garvin, Jeffrey J.
|by eight viewers. ...
|... and also might increase the message
|Making distributed spanning tree algorithms fault-resilient
Making distributed spanning tree algorithms fault-resilient
Bar-Yehuda, Reuven; Kutten, Shay; Wolfstahl, Yaron; Zaks, Shmuel
|... of tissue, a separate assessment of the
|Imaging of Red Blood Cell and Plasma Dispersion in the Brain Cortex
Imaging of Red Blood Cell and Plasma Dispersion in the Brain Cortex
|of RBC and plasma transit routes within ...
|Complexity index for the linear mechanisms of chemical reactions
Complexity index for the linear mechanisms of chemical reactions
Bonchev, D.; Kamenski, D.; Temkin, O. N.
|measure is proposed for the kinetic models ...
|... time 0(k·l·lgcn) and a corresponding space
|Posets, boolean representations and quick path searching
Posets, boolean representations and quick path searching
Gambosi, G.; Nešetřil, J.; Talamo, M.
|0(k(n+m lgn)lgcn), where c is a suitable ...
|... in an active region is one measure of the
|10.7-cm Solar radio flux and the magnetic complexity of active regions
10.7-cm Solar radio flux and the magnetic complexity of active regions
Wilson, Robert M.; Rabin, Douglas; Moore, Ronald L.
|of the magnetic structure of the region, ...
|... of interest both in algorithm design and
|Efficient algorithms for domination and Hamilton circuit problems on permutation graphs
Efficient algorithms for domination and Hamilton circuit problems on permutation graphs
Sastry, P. Shanthi; Jayakumar, N.; Veni Madhavan, C. E.
|... Nowhere is Taylorism and organizational
|more evident than in the automobile ...
|... in computer science. Known results on the
|The complexity of symmetric boolean functions
The complexity of symmetric boolean functions
|of symmetric functions in several models ...
|... The time
|Data structures and the time complexity of ray tracing
Data structures and the time complexity of ray tracing
Scherson, Isaac D.; Caspary, Elisha
|of ray tracing is a function of the data ...
|... is first classified by the logical
|Optimal Sequential Disassembly in the Plane
Optimal Sequential Disassembly in the Plane
Woo, Tony C.
|of its DT and by the geometric ...
|... some first steps towards a theory of
|First steps towards a theory of complexity over more general data structures
First steps towards a theory of complexity over more general data structures
|in the area of computations on more ...
|... one operation are usually very difficult.
|A Complexity Problem
A Complexity Problem
|problems fall into this category. ...
|... be able to cope with data structures of a
|Object Representation of Scope During Translation
Object Representation of Scope During Translation
Dewhurst, S. C.
|far exceeding what is needed for ...
|... of the device arrangement as well as the
|Technological developments for three-dimensional circuitry
Technological developments for three-dimensional circuitry
|of the connecting network. ...