FOCS 1992 - PDF Preprint Papers

FOCS 1992 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-1992 Paper

click to vote

FOCS
1992
IEEE

142views Theoretical Computer Science» more FOCS 1992»

Computing in Solvable Matrix Groups

13 years 8 months ago

Download ix.cs.uoregon.edu

We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...

Eugene M. Luks

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	142	Computing in Solvable Matrix Groups	claim
2	135	Back to the Future: Towards a Theory of Timed Regular Languages	claim
3	133	Proof Verification and Hardness of Approximation Problems	claim
4	121	Safe and Effective Determinant Evaluation	claim
5	118	On the Fault Tolerance of Some Popular Bounded-Degree Networks	claim
6	113	Maximizing Non-Linear Concave Functions in Fixed Dimension	claim
7	110	Dynamic Half-Space Reporting, Geometric Optimization, and Minimum Spanning Trees	claim
8	109	Quadratic Dynamical Systems (Preliminary Version)	claim
9	106	Witnesses for Boolean Matrix Multiplication and for Shortest Paths	claim
10	105	Reconstructing Algebraic Functions from Mixed Data	claim
11	100	On the Second Eigenvalue and Linear Expansion of Regular Graphs	claim
12	96	Efficient Minimum Cost Matching Using Quadrangle Inequality	claim
13	94	Separating the Communication Complexities of MOD m and MOD p Circuits	claim
14	92	Fault-tolerant Wait-free Shared Objects	claim
15	89	A Subexponential Algorithm for Abstract Optimization Problems	claim
16	86	On the Bit Extraction Problem	claim
17	84	Probabilistic Checking of Proofs; A New Characterization of NP	claim
18	81	Efficient Inference of Partial Types	claim
19	73	Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers