Výsledky vyhledávání - Circuit complexity Algebraic Formulas
-
1
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
ISSN: 0178-4617, 1432-0541Vydáno: New York Springer US 01.09.2023Vydáno v Algorithmica (01.09.2023)“… 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…”
Získat plný text
Journal Article -
2
Quadratic Lower Bounds for Algebraic Branching Programs and Formulas
ISSN: 1016-3328, 1420-8954Vydáno: Cham Springer International Publishing 01.12.2022Vydáno v Computational complexity (01.12.2022)“…We show that any Algebraic Branching Program (ABP) computing the polynomial ∑ i = 1 n x i n has at least Ω ( n 2 ) vertices…”
Získat plný text
Journal Article -
3
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
ISSN: 2575-8454Vydáno: IEEE 01.02.2022Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (01.02.2022)“…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…”
Získat plný text
Konferenční příspěvek -
4
Characterizing Valiant's algebraic complexity classes
ISSN: 0885-064X, 1090-2708Vydáno: Elsevier Inc 01.02.2008Vydáno v Journal of Complexity (01.02.2008)“…Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families…”
Získat plný text
Journal Article -
5
Demystifying the border of depth-3 algebraic circuits
ISSN: 2575-8454Vydáno: IEEE 01.02.2022Vydáno v Proceedings / annual Symposium on Foundations of Computer Science (01.02.2022)“… 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…”
Získat plný text
Konferenční příspěvek -
6
An Iterative FEM Solver for IC Electromagnetic Analysis via Hybrid Geometric-Algebraic Partitioning and Neural Network Optimization
ISSN: 0018-9480, 1557-9670Vydáno: New York IEEE 01.11.2025Vydáno v IEEE transactions on microwave theory and techniques (01.11.2025)“…In electromagnetic finite element analysis of integrated circuits (ICs), direct solvers face high time and space complexity in large-scale problems…”
Získat plný text
Journal Article -
7
Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees
ISSN: 1016-3328, 1420-8954Vydáno: Cham Springer International Publishing 01.09.2019Vydáno v Computational complexity (01.09.2019)“…We investigate the power of Non-commutative Arithmetic Circuits , which compute polynomials over the free non-commutative polynomial ring F ⟨ x 1 , … , x N…”
Získat plný text
Journal Article -
8
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
ISSN: 0022-0000, 1090-2724Vydáno: Elsevier Inc 2011Vydáno v Journal of computer and system sciences (2011)“… We prove lower bounds for several old and new subclasses of circuits: monotone circuits, orthogonal formulas, non-canceling formulas, and noise-resistant formulas…”
Získat plný text
Journal Article -
9
Homogeneous Algebraic Complexity Theory and Algebraic Formulas
ISSN: 2331-8422Vydáno: Ithaca Cornell University Library, arXiv.org 28.11.2023Vydáno v arXiv.org (28.11.2023)“…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…”
Získat plný text
Paper -
10
Algebraic proofs over noncommutative formulas
ISSN: 0890-5401, 1090-2651Vydáno: Amsterdam Elsevier Inc 01.10.2011Vydáno v Information and computation (01.10.2011)“…We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas…”
Získat plný text
Journal Article -
11
Schur Polynomials Do Not Have Small Formulas If the Determinant does not
ISSN: 1016-3328, 1420-8954Vydáno: Cham Springer International Publishing 01.06.2023Vydáno v Computational complexity (01.06.2023)“…) and geometric complexity theory Ikenmeyer & Panova (2017). However, unlike some other families of symmetric polynomials like the elementary symmetric polynomials, the power…”
Získat plný text
Journal Article -
12
Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree
ISSN: 0020-0190, 1872-6119Vydáno: Elsevier B.V 01.04.2020Vydáno v Information processing letters (01.04.2020)“…•A finer product decomposition for Homogeneous Formulas of small depth.•A finer product decomposition for small-depth homogeneous multi-r-ic formulas…”
Získat plný text
Journal Article -
13
Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas
ISSN: 1016-3328, 1420-8954Vydáno: Basel SP Birkhäuser Verlag Basel 01.03.2013Vydáno v Computational complexity (01.03.2013)“…” 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…”
Získat plný text
Journal Article -
14
Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting
ISSN: 1093-0159Vydáno: IEEE 01.06.2013Vydáno v Proceedings / IEEE Conference on Computational Complexity (01.06.2013)“…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…”
Získat plný text
Konferenční příspěvek -
15
Characterizing Valiant's algebraic complexity classes
ISSN: 0885-064XVydáno: Elsevier BV 01.01.2006Vydáno v Journal of Complexity (01.01.2006)Získat plný text
Journal Article -
16
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs
ISSN: 1016-3328, 1420-8954Vydáno: Cham Springer International Publishing 01.12.2019Vydáno v Computational complexity (01.12.2019)“…? Finding such a minimal representation is closely related to finding an optimal way to compute a given polynomial via an algebraic branching program…”
Získat plný text
Journal Article -
17
The Complexity of Tensor Circuit Evaluation
ISSN: 1016-3328, 1420-8954Vydáno: 01.05.2007Vydáno v Computational complexity (01.05.2007)Získat plný text
Journal Article -
18
z-Reliable SE-Coprognosability of Discrete Event Systems and an Algebraic State Space Approach to Verification
ISSN: 1549-7747, 1558-3791Vydáno: New York IEEE 01.12.2022Vydáno v IEEE transactions on circuits and systems. II, Express briefs (01.12.2022)“…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…”
Získat plný text
Journal Article -
19
Reduced-Complexity LCC Reed-Solomon Decoder Based on Unified Syndrome Computation
ISSN: 1063-8210, 1557-9999Vydáno: New York, NY IEEE 01.05.2013Vydáno v IEEE transactions on very large scale integration (VLSI) systems (01.05.2013)“… Algebraic soft-decision decoding (ASD) of RS codes can obtain significant coding gain over the hard-decision decoding (HDD…”
Získat plný text
Journal Article -
20
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
ISBN: 1470410222, 9781470410223Vydáno: Providence, R.I American Mathematical Society 2013“…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…”
Získat plný text
E-kniha Kniha

