Matrix decomposition problem is complete for the average case

Authors:
Y. Gurevich
Affiliations:
Michigan Univ., MI, USA
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 6

Bounded Depth Arithmetic Circuits: Counting and Closure

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A secret sharing scheme using matrices

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Yuri, logic, and computer science

Fields of logic and computation
Notes on Levin's theory of average-case complexity

Studies in complexity and cryptography
On the Average-Case Complexity of the Graph Reliability Problem on Gaussian Distributions

Fundamenta Informaticae
Counting paths in planar width 2 branching programs

CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first algebraic average-case complete problem is presented. The focus of attention is the modular group, i.e., the multiplicative group SL/sub 2/(Z) of two-by-two integer matrices of determinant 1. By default, in this study matrices are elements of the modular group. The problem is arguably the simplest natural average-case complete problem to date.