Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Completeness classes in algebra
Leslie G. Valiant
Type:
Article
Publication Date:
1979-01-01
Citations:
535
DOI:
https://doi.org/10.1145/800135.804419
Share
Similar Works
Action
Title
Year
Authors
+
Complexity Classes and Completeness in Algebraic Geometry
2018
M. Umut Isik
+
NP-Complete Problems in Linear Algebra
1990
Santhosh R. Sastry
Faculty Advisor Jeter
+
PDF
Chat
Completeness classes in algebraic complexity theory
2024
Peter Bürgisser
+
GENERIC COMPLEXITY OF ALGORITHMIC PROBLEMS
2022
Alexander Rybalov
+
Complexity of the finite algebra membership problem for varieties
1998
ZOLTÁN SZÉKELY
George F. McNulty
+
Independence in Algebraic Complexity Theory
2013
Johannes Mittmann
+
Challenging Problems in Algebra
1988
Alfred S. Posamentier
Charles T. Salkind
+
Classifying word problems of finitely generated algebras via computable reducibility
2023
Valentino Delle Rose
Luca San Mauro
Andrea Sorbi
+
PDF
Chat
Classifying word problems of finitely generated algebras via computable reducibility
2023
Valentino Delle Rose
Luca San Mauro
Andrea Sorbi
+
Computer Algebra Algorithms
1987
Erich Kaltofen
+
Handbook of Recursive Mathematics - Volume 2: Recursive Algebra, Analysis and Combinatorics
1998
+
Solvable and Unsolvable Problems in the Theory of Computable Numbers
1965
Brian H. Mayoh
+
Problems in computational algebra and integer programming
2007
Rekha R. Thomas
Tristram Bogart
+
A survey of techniques in applied computational complexity
1975
Robert Meersman
+
COMPLETENESS AND REDUCTION IN ALGEBRAIC COMPLEXITY THEORY (Algorithms and Computation in Mathematics 7) <i>By</i> P<scp>ETER</scp> B<scp>ÜRGISSER</scp>: 168 pp., $44.50, <scp>ISBN</scp> 3-540-66752-0 (Springer, Berlin, 2000).
2002
Dominic Welsh
+
PDF
Chat
COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA
2002
Clifford Bergman
Giora Slutzki
+
Algorithmic algebra and number theory : selected papers from a conference held at the University of Heidelberg in October 1997
1999
Heinrich Matzat
Gert–Martin Greuel
Gerhard Hiß
+
Computable Structure Theory of Partial Combinatory Algebras
2024
Ekaterina Fokina
Sebastiaan A. Terwijn
+
Topics in Computational Algebra
1990
Giulia Maria Piacentini Cattaneo
E. Strickland
+
An Introduction to Computational Algebraic Analysis
2003
Fabrizio Colombo
Irene Sabadini
Daniele C. Struppa
Works That Cite This (331)
Action
Title
Year
Authors
+
Représentations des polynômes, algorithmes et bornes inférieures
2012
Bruno Grenet
+
Partial Derivatives in Arithmetic Complexity and Beyond
2010
Xi Chen
Neeraj Kayal
Avi Wigderson
+
Rectangular Kronecker coefficients and plethysms in geometric complexity theory
2017
Christian Ikenmeyer
Greta Panova
+
PDF
Chat
Conic stability of polynomials and positive maps
2020
Papri Dey
Stephan Gardoll
Thorsten Theobald
+
PDF
Chat
VPSPACE and a Transfer Theorem over the Complex Field
2007
Pascal Koiran
Sylvain Perifel
+
PDF
Chat
No Occurrence Obstructions in Geometric Complexity Theory
2016
Peter Bürgisser
Christian Ikenmeyer
Greta Panova
+
Permanent versus determinant, obstructions, and Kronecker coefficients
2015
Peter Bürgisser
+
Non-commutative Optimization - Where Algebra, Analysis and Computational Complexity Meet
2022
Avi Wigderson
+
On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines
1988
Lenore Blum
M. Shub
Stephen T. Smale
+
Isomorphism problems for tensors, groups, and cubic forms: completeness and reductions
2019
Joshua A. Grochow
Youming Qiao
Works Cited by This (5)
Action
Title
Year
Authors
+
On the relation between the determinant and the permanent
1961
Marvin Marcus
Henryk Minc
+
Matrix Tree Theorems
1978
Seth Chaiken
Daniel J. Kleitman
+
Percolation Processes and Related Topics
1963
H. L. Frisch
J. M. Hammersley
+
Statistical Mechanics of Dimers on a Plane Lattice
1961
Michael E. Fisher
+
The Complexity of Enumeration and Reliability Problems
1979
Leslie G. Valiant