Suchergebnisse - Circuit complexity Algebraic Formulas

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials von Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.

“… families which are complete for algebraic complexity classes VBP , V P , and VNP . We discover that, in the monotone setting, the formula complexity, the ABP complexity …”
Volltext

Quadratic Lower Bounds for Algebraic Branching Programs and Formulas von Chatterjee, Prerona, Kumar, Mrinal, She, Adrian, Lee Volk, Ben

“… We show that any Algebraic Branching Program (ABP) computing the polynomial ∑ i = 1 n x i n has at least Ω ( n 2 ) vertices …”
Volltext

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits von Limaye, Nutan, Srinivasan, Srikanth, Tavenas, Sebastien

“… An Algebraic Circuit for a polynomial P\ \ \in \mathbb{F}[x_{1}, \ldots, x_{N}] is a computational model for constructing the polynomial P using only additions and multiplications …”
Volltext

Characterizing Valiant's algebraic complexity classes von Malod, Guillaume, Portier, Natacha

“… Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families …”
Volltext

Demystifying the border of depth-3 algebraic circuits von Dutta, Pranjal, Dwivedi, Prateek, Saxena, Nitin

“… We show that the border of bounded top-fanin-k depth-3 circuits, for constant k, is relatively easy- it can be computed by a polynomial size algebraic branching program (ABP …”
Volltext

An Iterative FEM Solver for IC Electromagnetic Analysis via Hybrid Geometric-Algebraic Partitioning and Neural Network Optimization von Li, Mingtao, Yan, Changhao, Cui, Tao, Jiang, Liguo, Dai, Wenliang, Bi, Zhaori, Zhu, Keren, Zeng, Xuan

“… In electromagnetic finite element analysis of integrated circuits (ICs), direct solvers face high time and space complexity in large-scale problems …”
Volltext

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees von Lagarde, Guillaume, Limaye, Nutan, Srinivasan, Srikanth

“… We investigate the power of Non-commutative Arithmetic Circuits , which compute polynomials over the free non-commutative polynomial ring F ⟨ x 1 , … , x N …”
Volltext

Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors von Raz, Ran, Yehudayoff, Amir

“… We prove lower bounds for several old and new subclasses of circuits: monotone circuits, orthogonal formulas, non-canceling formulas, and noise-resistant formulas …”
Volltext

Homogeneous Algebraic Complexity Theory and Algebraic Formulas von Dutta, Pranjal, Gesmundo, Fulvio, Ikenmeyer, Christian, Jindal, Gorav, Lysikov, Vladimir

“… We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were originally introduced by Valiant in 1979 …”
Volltext

Algebraic proofs over noncommutative formulas von Tzameret, Iddo

“… We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas …”
Volltext

Schur Polynomials Do Not Have Small Formulas If the Determinant does not von Chaugule, Prasad, Kumar, Mrinal, Limaye, Nutan, Mohapatra, Chandra Kanta, She, Adrian, Srinivasan, Srikanth

“… ) and geometric complexity theory Ikenmeyer & Panova (2017). However, unlike some other families of symmetric polynomials like the elementary symmetric polynomials, the power …”
Volltext

Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree von Chillara, Suryajith

“… •A finer product decomposition for Homogeneous Formulas of small depth.•A finer product decomposition for small-depth homogeneous multi-r-ic formulas …”
Volltext

Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas von Mahajan, Meena, Raghavendra Rao, B. V.

“… ” complexity of the computed function. Looking for a similar relationship in Valiant’s algebraic model of computation, we propose width of an arithmetic circuit as a possible measure of space …”
Volltext

Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting von Hrube, Pavel, Yehudayoff, Amir

“… We give an example of a non-commutative monotone polynomial f which can be computed by a polynomial-size non-commutative formula, but every monotone non-commutative circuit computing f must have an exponential size …”
Volltext

Characterizing Valiant's algebraic complexity classes von Malod, Guillaume, Portier, Natacha

Volltext

Average-case linear matrix factorization and reconstruction of low width algebraic branching programs von Kayal, Neeraj, Nair, Vineet, Saha, Chandan

“… ? Finding such a minimal representation is closely related to finding an optimal way to compute a given polynomial via an algebraic branching program …”
Volltext

The Complexity of Tensor Circuit Evaluation von Beaudry, Martin, Holzer, Markus

Volltext

z-Reliable SE-Coprognosability of Discrete Event Systems and an Algebraic State Space Approach to Verification von Yingrui, Zhou, Chen, Zengqiang, Ni, Yuanhua, Liu, Zhongxin

“… This brief investigates the problem of fault prognosis in decentralized structure, where given systems are monitored by <inline-formula> <tex-math notation="LaTeX">r </tex-math></inline-formula …”
Volltext

Reduced-Complexity LCC Reed-Solomon Decoder Based on Unified Syndrome Computation von Zhang, Wei, Wang, Hao, Pan, Boyang

“… Algebraic soft-decision decoding (ASD) of RS codes can obtain significant coding gain over the hard-decision decoding (HDD …”
Volltext

Women in Numbers 2 : research directions in number theory : BIRS Workshop, WIN2 -- Women in Numbers 2, November 6-11, 2011, Banff International Research Station, Banff, Alberta, Canada von WIN (Conference), David, Chantal, Lalin, Matilde, Manes, Michelle

“… The second Women in Numbers workshop (WIN2) was held November 6-11, 2011, at the Banff International Research Station (BIRS) in Banff, Alberta, Canada. During …”
Volltext