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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory
description / endescription / en
scientific article
scientific article; zbMATH DE number 6605932
Property / title
 
Some Complete and Intermediate Polynomials in Algebraic Complexity Theory (English)
Property / title: Some Complete and Intermediate Polynomials in Algebraic Complexity Theory (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1385.68018 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-34171-2_18 / rank
 
Normal rank
Property / published in
 
Property / published in: Computer Science – Theory and Applications / rank
 
Normal rank
Property / publication date
 
25 July 2016
Timestamp+2016-07-25T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 25 July 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6605932 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2299632561 / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive query containment revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of counting homomorphisms seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2808529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy Theorems for Homomorphism Polynomials of Graph Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible arithmetic computations: Valiant's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4602399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of homomorphism and constraint satisfaction problems seen from the other side / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complete and intermediate polynomials in algebraic complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic Circuits: A survey of recent results and open questions / rank
 
Normal rank

Latest revision as of 19:57, 15 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
0 references
0 references
0 references
0 references
0 references
0 references
0 references