Výsledky vyhľadávania - Circuit complexity Algebraic Formulas

  1. 1

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

    ISSN: 0178-4617, 1432-0541
    Vydavateľské údaje: New York Springer US 01.09.2023
    Vydané 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ískať plný text
    Journal Article
  2. 2

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

    ISSN: 1016-3328, 1420-8954
    Vydavateľské údaje: Cham Springer International Publishing 01.12.2022
    Vydané 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ískať plný text
    Journal Article
  3. 3

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

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 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ískať plný text
    Konferenčný príspevok..
  4. 4

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

    ISSN: 0885-064X, 1090-2708
    Vydavateľské údaje: Elsevier Inc 01.02.2008
    Vydané v Journal of Complexity (01.02.2008)
    “…Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families…”
    Získať plný text
    Journal Article
  5. 5

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

    ISSN: 2575-8454
    Vydavateľské údaje: IEEE 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ískať plný text
    Konferenčný príspevok..
  6. 6

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

    ISSN: 0018-9480, 1557-9670
    Vydavateľské údaje: New York IEEE 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ískať plný text
    Journal Article
  7. 7

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

    ISSN: 1016-3328, 1420-8954
    Vydavateľské údaje: Cham Springer International Publishing 01.09.2019
    Vydané 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ískať plný text
    Journal Article
  8. 8

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

    ISSN: 0022-0000, 1090-2724
    Vydavateľské údaje: Elsevier Inc 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ískať plný text
    Journal Article
  9. 9

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

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 28.11.2023
    Vydané 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ískať plný text
    Paper
  10. 10

    Algebraic proofs over noncommutative formulas Autor Tzameret, Iddo

    ISSN: 0890-5401, 1090-2651
    Vydavateľské údaje: Amsterdam Elsevier Inc 01.10.2011
    Vydané v Information and computation (01.10.2011)
    “…We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas…”
    Získať plný text
    Journal Article
  11. 11

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

    ISSN: 1016-3328, 1420-8954
    Vydavateľské údaje: Cham Springer International Publishing 01.06.2023
    Vydané 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ískať plný text
    Journal Article
  12. 12

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

    ISSN: 0020-0190, 1872-6119
    Vydavateľské údaje: Elsevier B.V 01.04.2020
    Vydané 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ískať plný text
    Journal Article
  13. 13

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

    ISSN: 1016-3328, 1420-8954
    Vydavateľské údaje: Basel SP Birkhäuser Verlag Basel 01.03.2013
    Vydané 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ískať plný text
    Journal Article
  14. 14

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

    ISSN: 1093-0159
    Vydavateľské údaje: IEEE 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ískať plný text
    Konferenčný príspevok..
  15. 15

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

    ISSN: 0885-064X
    Vydavateľské údaje: Elsevier BV 01.01.2006
    Vydané v Journal of Complexity (01.01.2006)
    Získať plný text
    Journal Article
  16. 16

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

    ISSN: 1016-3328, 1420-8954
    Vydavateľské údaje: Cham Springer International Publishing 01.12.2019
    Vydané 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ískať plný text
    Journal Article
  17. 17

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

    ISSN: 1016-3328, 1420-8954
    Vydavateľské údaje: 01.05.2007
    Vydané v Computational complexity (01.05.2007)
    Získať plný text
    Journal Article
  18. 18

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

    ISSN: 1549-7747, 1558-3791
    Vydavateľské údaje: New York IEEE 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ískať plný text
    Journal Article
  19. 19

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

    ISSN: 1063-8210, 1557-9999
    Vydavateľské údaje: New York, NY IEEE 01.05.2013
    “… Algebraic soft-decision decoding (ASD) of RS codes can obtain significant coding gain over the hard-decision decoding (HDD…”
    Získať plný text
    Journal Article
  20. 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 Autor WIN (Conference), David, Chantal, Lalin, Matilde, Manes, Michelle

    ISBN: 1470410222, 9781470410223
    Vydavateľské údaje: 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ískať plný text
    E-kniha Kniha