FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2213867208> ?p ?o ?g. }

• W2213867208 abstract "Kayal has recently introduced the method of shifted partial derivatives as a way to give the first exponential lower bound for computing an explicit polynomial as a sum of powers of constant-degree polynomials. This method has garnered further attention because of the work of Gupta, Kamath, Kayal and Saptharishi who used this method to obtain lower bounds that approach the chasm at depth-4. In this work, we investigate to what extent this method can be used to obtain deterministic polynomial identity testing (PIT) algorithms, which are algorithms that decide whether a given algebraic circuit computes the zero polynomial. In particular, we give a poly(s)(log s)-time deterministic black-box PIT algorithm for a size-s sum of powers of constant-degree polynomials. This is the first sub-exponential deterministic PIT algorithm for this model of computation and the first PIT algorithm based on the method of shifted partial derivatives. We also study the problem of divisibility testing, which when given multivariate polynomials f and g (as algebraic circuits) asks to decide whether f divides g. Using Strassen's technique for the elimination of divisions, we show that one can obtain deterministic divisibility testing algorithms via deterministic PIT algorithms, and this reduction does not dramatically increase the complexity of the underlying algebraic circuits. Using this reduction, we show that deciding divisibility of a constant-degree polynomial f into a sparse polynomial g reduces to PIT of sums of a monomial multiplied by a power of constant-degree polynomials. We then extend the method of shifted partial derivatives to give a poly(s)(log s)-time deterministic black-box PIT algorithm for this model of computation, and thus derive a corresponding deterministic divisibility algorithm. This is the first non-trivial deterministic algorithm for this problem. Previous work on multivariate divisibility testing due to Saha, Saptharishi and Saxena gave algorithms for when f is linear and g is sparse, and essentially worked via PIT algorithms for read-once (oblivious) algebraic branching programs (roABPs). We give explicit sums of powers of quadratic polynomials that require exponentially-large roABPs in a strong sense, showing that techniques known for roABPs have limited applicability in our regime. Finally, by combining our results with the algorithm of Forbes, Shpilka and Saptharishi we obtain poly(s)(log log s)-time deterministic black-box PIT algorithms for various models (translations of sparse polynomials, and sums of monomials multiplied by a power of a linear polynomial) where only poly(s) (Theta(log s))-time such algorithms were previously known." @default.
• W2213867208 created "2016-06-24" @default.
• W2213867208 creator A5017319217 @default.
• W2213867208 date "2015-10-01" @default.
• W2213867208 modified "2023-09-24" @default.
• W2213867208 title "Deterministic Divisibility Testing via Shifted Partial Derivatives" @default.
• W2213867208 cites W1503731768 @default.
• W2213867208 cites W1508771701 @default.
• W2213867208 cites W1571321110 @default.
• W2213867208 cites W1599026900 @default.
• W2213867208 cites W1964748897 @default.
• W2213867208 cites W1967348711 @default.
• W2213867208 cites W1968245619 @default.
• W2213867208 cites W1972473080 @default.
• W2213867208 cites W1973174141 @default.
• W2213867208 cites W1976166549 @default.
• W2213867208 cites W1981234161 @default.
• W2213867208 cites W1984806876 @default.
• W2213867208 cites W1991584875 @default.
• W2213867208 cites W1992071680 @default.
• W2213867208 cites W1998853590 @default.
• W2213867208 cites W2002803848 @default.
• W2213867208 cites W2015393485 @default.
• W2213867208 cites W2015679114 @default.
• W2213867208 cites W2016576580 @default.
• W2213867208 cites W2024334120 @default.
• W2213867208 cites W2026036943 @default.
• W2213867208 cites W2028346139 @default.
• W2213867208 cites W2044399075 @default.
• W2213867208 cites W2064885856 @default.
• W2213867208 cites W2069546133 @default.
• W2213867208 cites W2079910744 @default.
• W2213867208 cites W2080132708 @default.
• W2213867208 cites W2081256023 @default.
• W2213867208 cites W2084050956 @default.
• W2213867208 cites W2092082049 @default.
• W2213867208 cites W2104644213 @default.
• W2213867208 cites W2109995168 @default.
• W2213867208 cites W2121894367 @default.
• W2213867208 cites W2128510017 @default.
• W2213867208 cites W2129530428 @default.
• W2213867208 cites W2130196976 @default.
• W2213867208 cites W2136589970 @default.
• W2213867208 cites W2139434573 @default.
• W2213867208 cites W2150559011 @default.
• W2213867208 cites W2153445467 @default.
• W2213867208 cites W2169939595 @default.
• W2213867208 cites W2170546552 @default.
• W2213867208 cites W2171403864 @default.
• W2213867208 cites W2172394696 @default.
• W2213867208 cites W2172695686 @default.
• W2213867208 cites W2177482211 @default.
• W2213867208 cites W2319466955 @default.
• W2213867208 cites W2610729871 @default.
• W2213867208 cites W3098163749 @default.
• W2213867208 cites W3103519306 @default.
• W2213867208 cites W4234712203 @default.
• W2213867208 doi "https://doi.org/10.1109/focs.2015.35" @default.
• W2213867208 hasPublicationYear "2015" @default.
• W2213867208 type Work @default.
• W2213867208 sameAs 2213867208 @default.
• W2213867208 citedByCount "21" @default.
• W2213867208 countsByYear W22138672082015 @default.
• W2213867208 countsByYear W22138672082016 @default.
• W2213867208 countsByYear W22138672082017 @default.
• W2213867208 countsByYear W22138672082018 @default.
• W2213867208 countsByYear W22138672082019 @default.
• W2213867208 countsByYear W22138672082020 @default.
• W2213867208 countsByYear W22138672082021 @default.
• W2213867208 countsByYear W22138672082022 @default.
• W2213867208 crossrefType "proceedings-article" @default.
• W2213867208 hasAuthorship W2213867208A5017319217 @default.
• W2213867208 hasConcept C11413529 @default.
• W2213867208 hasConcept C118615104 @default.
• W2213867208 hasConcept C33923547 @default.
• W2213867208 hasConcept C41008148 @default.
• W2213867208 hasConcept C9991821 @default.
• W2213867208 hasConceptScore W2213867208C11413529 @default.
• W2213867208 hasConceptScore W2213867208C118615104 @default.
• W2213867208 hasConceptScore W2213867208C33923547 @default.
• W2213867208 hasConceptScore W2213867208C41008148 @default.
• W2213867208 hasConceptScore W2213867208C9991821 @default.
• W2213867208 hasLocation W22138672081 @default.
• W2213867208 hasOpenAccess W2213867208 @default.
• W2213867208 hasPrimaryLocation W22138672081 @default.
• W2213867208 hasRelatedWork W2333698505 @default.
• W2213867208 hasRelatedWork W2351491280 @default.
• W2213867208 hasRelatedWork W2371447506 @default.
• W2213867208 hasRelatedWork W2386767533 @default.
• W2213867208 hasRelatedWork W2748952813 @default.
• W2213867208 hasRelatedWork W2889453578 @default.
• W2213867208 hasRelatedWork W288954959 @default.
• W2213867208 hasRelatedWork W2899084033 @default.
• W2213867208 hasRelatedWork W303980170 @default.
• W2213867208 hasRelatedWork W3141679561 @default.
• W2213867208 isParatext "false" @default.
• W2213867208 isRetracted "false" @default.
• W2213867208 magId "2213867208" @default.
• W2213867208 workType "article" @default.