scholarly journals Characterizing Valiant's algebraic complexity classes

2008 ◽  
Vol 24 (1) ◽  
pp. 16-38 ◽  
Author(s):  
Guillaume Malod ◽  
Natacha Portier
Keyword(s):  
Complexity Classes ◽  
Algebraic Complexity

scholarly journals The Computational Complexity of Plethysm Coefficients

2020 ◽  
Vol 29 (2) ◽  
Author(s):  
Nick Fischer ◽  
Christian Ikenmeyer
Keyword(s):  
Matrix Multiplication ◽  
Complexity Classes ◽  
Algebraic Complexity ◽  
Test Bed ◽  
Discrete Tomography ◽  
Geometric Complexity Theory ◽  
Special Cases ◽  
The Matrix ◽  
Kronecker Coefficients ◽  
Coordinate Rings

AbstractIn two papers, Bürgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix multiplication tensor. A key ingredient was information about certain Kronecker coefficients. While tensors are an interesting test bed for GCT ideas, the far-away goal is the separation of algebraic complexity classes. The role of the Kronecker coefficients in that setting is taken by the so-called plethysm coefficients: These are the multiplicities in the coordinate rings of spaces of polynomials. Even though several hardness results for Kronecker coefficients are known, there are almost no results about the complexity of computing the plethysm coefficients or even deciding their positivity.In this paper, we show that deciding positivity of plethysm coefficients is -hard and that computing plethysm coefficients is #-hard. In fact, both problems remain hard even if the inner parameter of the plethysm coefficient is fixed. In this way, we obtain an inner versus outer contrast: If the outer parameter of the plethysm coefficient is fixed, then the plethysm coefficient can be computed in polynomial time. Moreover, we derive new lower and upper bounds and in special cases even combinatorial descriptions for plethysm coefficients, which we consider to be of independent interest. Our technique uses discrete tomography in a more refined way than the recent work on Kronecker coefficients by Ikenmeyer, Mulmuley, and Walter (Comput Compl 2017). This makes our work the first to apply techniques from discrete tomography to the study of plethysm coefficients. Quite surprisingly, that interpretation also leads to new equalities between certain plethysm coefficients and Kronecker coefficients.

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes

2021 ◽  
Vol 13 (4) ◽  
pp. 1-26
Author(s):  
Prasad Chaugule ◽  
Nutan Limaye ◽  
Aditya Varre
Keyword(s):  
Complexity Classes ◽  
Algebraic Complexity ◽  
Branching Programs ◽  
Algebraic Branching Programs ◽  
Graph Homomorphisms ◽  
Model Independent ◽  
Injective Homomorphisms

We present polynomial families complete for the well-studied algebraic complexity classes VF, VBP, VP, and VNP. The polynomial families are based on the homomorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. (2018). We consider three different variants of graph homomorphisms, namely injective homomorphisms , directed homomorphisms , and injective directed homomorphisms , and obtain polynomial families complete for VF, VBP, VP, and VNP under each one of these. The polynomial families have the following properties: • The polynomial families complete for VF, VBP, and VP are model independent, i.e., they do not use a particular instance of a formula, algebraic branching programs, or circuit for characterising VF, VBP, or VP, respectively. • All the polynomial families are hard under p -projections.

Logical Decision Problems and Complexity of Logic Programs

1987 ◽  
Vol 10 (1) ◽  
pp. 1-33
Author(s):  
Egon Börger ◽  
Ulrich Löwen
Keyword(s):  
Fixed Point ◽  
Computational Complexity ◽  
Decision Problem ◽  
Decision Problems ◽  
Complexity Classes ◽  
Logic Programs ◽  
Finite Structures ◽  
Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

Completeness for nondeterministic complexity classes

1991 ◽  
Vol 24 (1) ◽  
pp. 179-200 ◽  
Author(s):  
Harry Buhrman ◽  
Steven Homer ◽  
Leen Torenvliet
Keyword(s):  
Complexity Classes

A simplified formulation of adhesion problems with elastic plates

2009 ◽  
Vol 465 (2107) ◽  
pp. 2217-2230 ◽  
Author(s):  
Carmel Majidi ◽  
George G. Adams
Keyword(s):  
Potential Energy ◽  
Contact Area ◽  
Contact Region ◽  
Bending Moment ◽  
Total Potential Energy ◽  
Work Of Adhesion ◽  
Contact Radius ◽  
Algebraic Complexity ◽  
Elastic Plates ◽  
Total Potential

The solution of adhesion problems with elastic plates generally involves solving a boundary-value problem with an assumed contact area. The contact region is then found by minimizing the total potential energy with respect to the contact area (i.e. the contact radius for the axisymmetric case). Such a procedure can be extremely long and tedious. Here, we show that the inclusion of adhesion is equivalent to specifying a discontinuous internal bending moment at the contact region boundary. The magnitude of this moment discontinuity is related to the work of adhesion and flexural rigidity of the plate. Such a formulation can greatly reduce the algebraic complexity of solving these problems. It is noted that the related plate contact problems without adhesion can also be solved by minimizing the total potential energy. However, it has long been recognized that it is mathematically more efficient to find the contact area by specifying a continuous internal bending moment at the boundary of the contact region. Thus, our moment discontinuity method can be considered to be a generalization of that procedure which is applicable for problems with adhesion.

scholarly journals Languages that Capture Complexity Classes

1987 ◽  
Vol 16 (4) ◽  
pp. 760-778 ◽  
Author(s):  
Neil Immerman
Keyword(s):  
Complexity Classes
Sign in / Sign up

Export Citation Format

Share Document