Some complete and intermediate polynomials in algebraic complexity theory (Q1635814): Difference between revisions

From MaRDI portal
Merged Item from Q5740190
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension complexity of combinatorial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness and reduction in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cook's versus Valiant's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The arithmetic complexity of tensor contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dichotomy Theorem for Homomorphism Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphism Polynomials Complete for VP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying known lower bounds via geometric complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Exact Complexity Results for Straight-Line Computations over Semirings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines that take advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Valiant's algebraic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on monotone complexity of the logical permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Polynomials Using Few Processors / rank
 
Normal rank

Revision as of 08:49, 12 July 2024

scientific article; zbMATH DE number 6605932
  • Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
Language Label Description Also known as
English
Some complete and intermediate polynomials in algebraic complexity theory
scientific article; zbMATH DE number 6605932
  • Some Complete and Intermediate Polynomials in Algebraic Complexity Theory

Statements

Some complete and intermediate polynomials in algebraic complexity theory (English)
0 references
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory (English)
0 references
0 references
0 references
0 references
0 references
1 June 2018
0 references
25 July 2016
0 references
0 references
0 references
0 references
0 references
0 references
0 references
completeness
0 references
VP
0 references
VNP-intermediate
0 references
VBP
0 references
homomorphisms
0 references
monotone projections
0 references
lower bounds
0 references
extension complexity
0 references
tree decomposition
0 references
0 references
0 references
0 references