scientific article; zbMATH DE number 3936520

zbMATH Open0584.68063MaRDI QIDQ3707409FDOQ3707409

Authors: Leslie G. Valiant 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• A complexity theory based on Boolean algebra
• Computational complexity in algebraic systems
• Constant Depth Reducibility
• On the relative power of reduction notions in arithmetic circuit complexity
• Complexity classes and completeness in algebraic geometry

zbMATH Keywords

reducibilityalgebraic structuresp-projectionrelative difficulty of computational problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (28)

• Counting complexity classes for numeric computations II
• Title not available (Why is that?)
• A complexity theory of constructible functions and sheaves
• An affine representation of de Casteljau's and de Boor's rational algorithms
• On the algebraic complexity of set equality and inclusion
• On computation complexity problems concerning relation algebras
• Computational complexity of learning algebraic varieties
• Wildness for tensors
• Connectivity of joins, cohomological quantifier elimination, and an algebraic Toda's theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algebraic approach to computations with progress
• Integer complexity: algorithms and computational results
• Additive complexity in directed computations
• On the relative power of reduction notions in arithmetic circuit complexity
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• Algebraic dependence in generating functions and expansion complexity
• A framework for solving VLSI graph layout problems
• Title not available (Why is that?)
• Completeness and reduction in algebraic complexity theory
• Complexity of the normalization of algebras
• A complexity theory based on Boolean algebra
• First-order reduction and computational complexity
• Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series
• Abstract algebraic structure of analytic theory of algorithms
• On the complexity of the differential-algebraic description of analytic complexity classes
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707409)