Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
A probabilistic algorithm to test local algebraic observability in polynomial time
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Lower bounds for dynamic algebraic problems
Information and Computation
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
A Fast Program Generator of Fast Fourier Transforms
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Real Computations with Fake Numbers
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Complete Problems for Valiant's Class of qp-Computable Families of Polynomials
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
The complexity of bivariate power series arithmetic
Theoretical Computer Science - Mathematical foundations of computer science
Nearly tight bounds on the learnability of evolution
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fast computation of discrete invariants associated to a differential rational mapping
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Complexity issues in bivariate polynomial factorization
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
On reducing a system of equations to a single equation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Polynomial equation solving by lifting procedures for ramified fibers
Theoretical Computer Science - Algebraic and numerical algorithm
Computability in linear algebra
Theoretical Computer Science
On the ultimate complexity of factorials
Theoretical Computer Science
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
Fast sparse matrix multiplication
ACM Transactions on Algorithms (TALG)
Stability versus speed in a computable algebraic model
Theoretical Computer Science - Real numbers and computers
Group-theoretic algorithms for matrix multiplication
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Low complexity algorithms for linear recurrences
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computing multihomogeneous resultants using straight-line programs
Journal of Symbolic Computation
Communication-efficient parallel generic pairwise elimination
Future Generation Computer Systems - Special section: Information engineering and enterprise architecture in distributed computing environments
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Some recent progress in exact linear algebra and related questions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Fast computation of power series solutions of systems of differential equations
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Generating unlabeled connected cubic planar graphs uniformly at random
Random Structures & Algorithms
A quadratic lower bound for the permanent and determinant problem over any characteristic ≠ 2
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Elusive functions and lower bounds for arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Power series composition and change of basis
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
(Short) Survey of Real Hypercomputation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice
On Faster Integer Calculations Using Non-arithmetic Primitives
UC '08 Proceedings of the 7th international conference on Unconventional Computing
Theoretical Computer Science
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Code Generation for Polynomial Multiplication
CASC '09 Proceedings of the 11th International Workshop on Computer Algebra in Scientific Computing
Complexity of checking the existence of a stabilizing decentralized controller
ACC'09 Proceedings of the 2009 conference on American Control Conference
Probabilistically Checkable Proofs Over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Explicit formulas for efficient multiplication in F36m
SAC'07 Proceedings of the 14th international conference on Selected areas in cryptography
An authentication scheme based on the twisted conjugacy problem
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Triangular decomposition of semi-algebraic systems
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
transalpyne: a language for automatic transposition
ACM Communications in Computer Algebra
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Applications of FFT and structured matrices
Algorithms and theory of computation handbook
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Graph expansion and communication costs of fast matrix multiplication: regular submission
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Geometric complexity theory and tensor rank
Proceedings of the forty-third annual ACM symposium on Theory of computing
Recent progress in linear algebra and lattice basis reduction
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Multihomogeneous polynomial decomposition using moment matrices
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Fast fourier transforms over poor fields
Proceedings of the 36th international symposium on Symbolic and algebraic computation
When is there a multipartite maximum entangled state?
Quantum Information & Computation
Faster polynomial multiplication via discrete fourier transforms
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Bit-size estimates for triangular sets in positive dimension
Journal of Complexity
Optimal column-based low-rank matrix reconstruction
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimization and approximation problems related to polynomial system solving
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Quadratic lower bounds on matrix rigidity
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Lower bounds on matrix rigidity via a quantum argument
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Concrete multiplicative complexity of symmetric functions
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
An efficient algorithm for the sign condition problem in the semi-algebraic context
GMP'10 Proceedings of the 6th international conference on Advances in Geometric Modeling and Processing
Lower bounds for geometric diameter problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Simplified high-speed high-distance list decoding for alternant codes
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
The GCT program toward the P vs. NP problem
Communications of the ACM
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Fast matrix rank algorithms and applications
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Affine projections of polynomials: extended abstract
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Multiplying matrices faster than coppersmith-winograd
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fast Polynomial Factorization and Modular Composition
SIAM Journal on Computing
Finding optimal formulae for bilinear maps
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
Semisimple algebras of almost minimal rank over the reals
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
"Resistant" polynomials and stronger lower bounds for depth-three arithmetical formulas
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Graph expansion and communication costs of fast matrix multiplication
Journal of the ACM (JACM)
On the complexity of computing with zero-dimensional triangular sets
Journal of Symbolic Computation
On the bit-complexity of sparse polynomial and series multiplication
Journal of Symbolic Computation
Triangular decomposition of semi-algebraic systems
Journal of Symbolic Computation
Inversion modulo zero-dimensional regular chains
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
Structured FFT and TFT: symmetric and lattice polynomials
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Explicit lower bounds via geometric complexity theory
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Fast matrix rank algorithms and applications
Journal of the ACM (JACM)
Non-commutative arithmetic circuits with division
Proceedings of the 5th conference on Innovations in theoretical computer science
Modular Composition Modulo Triangular Sets and Applications
Computational Complexity
Fast monotone summation over disjoint sets
Information Processing Letters
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
Hi-index | 0.02 |
This is the first book to present an up-to-date and self-contained account of Algebraic Complexity Theory that is both comprehensive and unified. Requiring of the reader only some basic algebra and offering over 350 exercises, it is well-suited as a textbook for beginners at graduate level. With its extensive bibliography covering about 500 research papers, this text is also an ideal reference book for the professional researcher. The subdivision of the contents into 21 more or less independent chapters enables readers to familiarize themselves quickly with a specific topic, and facilitates the use of this book as a basis for complementary courses in other areas such as computer algebra.