Characterization of Associative Operations With Prefix Circuits of Constant Depth and Linear Size

SIAM Journal on Computing - United States
doi 10.1137/0219016
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2009English

A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth

2018English

Expressive Attribute-Based Encryption With Constant-Size Ciphertexts From the Decisional Linear Assumption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Expressive Attribute-Based Encryption With Constant-Size Ciphertexts From the Decisional Linear Assumption

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2020English

Reconstruction of Depth-4 Multilinear Circuits

2020English

Threshold Circuits of Small Majority-Depth

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1998English

Size-Time Complexity of Boolean Networks for Prefix Computations

1987English

Familiar Size and Linear Perspective as Distance Cues in Stereoscopic Depth Constancy

Perception & Psychophysics
1980English

Types of Depth and Formula Size

Asian-European Journal of Mathematics
Mathematics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy