Monotone Circuits for Weighted Threshold Functions

Authors:
Amos Beimel;Enav Weinreb
Affiliations:
Ben-Gurion University;Ben-Gurion University
Venue:
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Year:
2005

Citing 0
Cited 1

Secret-sharing schemes: a survey

IWCC'11 Proceedings of the Third international conference on Coding and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the complexity of the isomorphism and automorphism problems for finite rings with unity. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of rings. The problem is shown to be in the ...