Polynomial Identity Testing for Depth 3 Circuits

Computational Complexity - Switzerland
doi 10.1007/s00037-007-0226-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

More on Noncommutative Polynomial Identity Testing

English

Quantum Homomorphic Encryption for Polynomial-Sized Circuits

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Reconstruction of Depth-4 Multilinear Circuits

2020English

New Automatic Testing Architecture for Integrated Circuits

The International Conference on Electrical Engineering
2006English

Threshold Circuits of Small Majority-Depth

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

Improvements in Polynomial-Time Feasibility Testing for EDF

2008English

Laser Testing of Integrated Circuits

IEEE Journal of Solid-State Circuits
Electronic EngineeringElectrical
1977English

Non-Malleable Codes and Extractors for Small-Depth Circuits, and Affine Functions

2017English

Twisted Group Algebras Satisfying a Generalized Polynomial Identity

Communications in Algebra
Number TheoryAlgebra
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy