[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Bilardi et al., 1990 - Google Patents

Characterization of associative operations with prefix circuits of constant depth and linear size

Bilardi et al., 1990

View PDF
Document ID
12454692459751403454
Author
Bilardi G
Preparata F
Publication year
Publication venue
SIAM Journal on Computing

External Links

Snippet

The prefix problem consits of computing all the products x_0x_1⋯x_j(j=0,⋯,N-1), given a sequence \bfx=(x_0,x_1,⋯,x_N-1) of elements in a semigroup. It is shown that there are unbounded fan-in and fan-out Boolean circuits for the prefix problem with constant depth …
Continue reading at ecommons.cornell.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
    • G06F7/64—Digital differential analysers, i.e. computing devices for differentiation, integration or solving differential or integral equations, using pulses representing increments; Other incremental computing devices for solving difference equations
    • G06F7/66—Digital differential analysers, i.e. computing devices for differentiation, integration or solving differential or integral equations, using pulses representing increments; Other incremental computing devices for solving difference equations wherein pulses represent unitary increments only
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06G—ANALOGUE COMPUTERS
    • G06G7/00—Devices in which the computing operation is performed by varying electric or magnetic quantities
    • G06G7/48—Analogue computers for specific processes, systems or devices, e.g. simulators

Similar Documents

Publication Publication Date Title
Mateti et al. On algorithms for enumerating all circuits of a graph
Ben-Or et al. A deterministic algorithm for sparse multivariate polynomial interpolation
Parthasarathy et al. A testable design of iterative logic arrays
Kavi et al. Isomorphisms between petr nets and dataflow graphs
Bodlaender The classification of coverings of processor networks
Kelleher et al. Dominating sets in social network graphs
Bilardi et al. Characterization of associative operations with prefix circuits of constant depth and linear size
Fujiwara et al. Testing logic circuits with compressed data
Drechsler et al. Testability of 2-level AND/EXOR circuits
Ramarao Distributed sorting on local area networks
Kaplan et al. The unweighted and weighted reverse shortest path problem for disk graphs
Jensen Optimum network partitioning
Kleitman et al. On the design of reliable Boolean circuits that contain partially unreliable gates
Chattopadhyay et al. KGPMIN: An efficient multilevel multioutput AND-OR-XOR minimizer
Paik et al. Deleting vertices to bound path length
Shogan A decomposition algorithm for network reliability analysis
Swain et al. Parallel hardware for constraint satisfaction
Fleischer On the complexity of the Cayley semigroup membership problem
Hayes Generation of optimal transition count tests
Kundu et al. Comparative study on null boundary and periodic boundary 3-neighborhood multiple attractor cellular automata for classification
Ceterchi et al. Implementing sorting networks with spiking neural P systems
Falkowski et al. Polynomial expansions over GF (3) based on fastest transformation
Stigall et al. A review of directed graphs as applied to computors
Cai et al. Degree-bounded spanners
Larson Sums of semiprime, 𝑧, and 𝑑𝑙-ideals in a class of 𝑓-rings