Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
type: Item
instance of: scholarly article
title: Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
zbMATH Open document ID: 1446.12001
author: Anurag Pandey
author: Nitin Saxena
author: Amit Sinhababu
published in: Computational Complexity
publication date: 2018-12-10T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6505/
Mathematics Subject Classification ID: 12-08
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6991116
zbMATH Keywords: independence
zbMATH Keywords: transcendence
zbMATH Keywords: finite field
zbMATH Keywords: Hasse-Schmidt
zbMATH Keywords: Jacobian
zbMATH Keywords: differential
zbMATH Keywords: inseparable
zbMATH Keywords: degree
zbMATH Keywords: circuit
zbMATH Keywords: identity testing
zbMATH Keywords: lower bound
zbMATH Keywords: depth-4
zbMATH Keywords: shifted partials
describes a project that uses: lowerbounds-survey
describes a project that uses: GitHub
MaRDI profile type: Publication
OpenAlex ID: W2803711344
cites work: Bootstrapping variables in algebraic circuits
cites work: Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits
cites work: Quasi-polynomial hitting-set for set-depth-Δ formulas
cites work: The complexity of partial derivatives
cites work: Algebraic independence and blackbox identity testing
cites work: Q4314299
cites work: Q4805122
cites work: Q4331740
cites work: Q3413659
cites work: Fast Parallel Matrix Inversion Algorithms
cites work: Counting Matchings of Size k Is $\sharp$ W[1]-Hard
cites work: A probabilistic remark on algebraic program testing
cites work: Discovering the roots: uniform closure results for algebraic classes under factoring
cites work: Extractors and rank extractors for polynomial sources
cites work: Extractors for varieties
cites work: Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers
cites work: Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
cites work: Apolarity and canonical forms for homogeneous polynomials
cites work: Q4023676
cites work: Arithmetic circuits: a chasm at depth 3
cites work: Q5767091
cites work: Q4297050
cites work: Q4305281
cites work: Q5328221
cites work: A Lower Bound for the Formula Size of Rational Functions
cites work: Q4660637
cites work: Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
cites work: An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas
cites work: A super-polynomial lower bound for regular arithmetic formulas
cites work: A Course in Commutative Algebra
cites work: Advanced Algebra
cites work: Q4138813
cites work: Q4539568
cites work: Q5317677
cites work: Q5368768
cites work: On the Power of Homogeneous Depth 4 Arithmetic Circuits
cites work: On the Algebraic Characteristic Set for a Class of Matroids
cites work: Q3687686
cites work: Algebraic independence in positive characteristic: A $p$-adic calculus
cites work: Factors of low individual degree polynomials
cites work: Q5484515
cites work: Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits
cites work: Q5486581
cites work: Q5302096
cites work: Q4636586
cites work: Progress on Polynomial Identity Testing-II
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
cites work: Arithmetic Circuits: A survey of recent results and open questions

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (cites work)
cites work: Q4047029

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (cites work)
cites work: Modern computer algebra

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (cites work)
cites work: Q3851616

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Wikidata QID)
Wikidata QID: Q129892134

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (DOI)
DOI: 10.1007/S00037-018-0167-5

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits
Similarity Score: 0.996478
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Q5368768
Similarity Score: 0.8409808
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Q5368901
Similarity Score: 0.8409808
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: A criterion for algebraic independence with some applications
Similarity Score: 0.8325863
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains
Similarity Score: 0.82995516
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Q5092488
Similarity Score: 0.82608205
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Q5215662
Similarity Score: 0.8227888
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Algebraic independence in positive characteristic: A $p$-adic calculus
Similarity Score: 0.82275736
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Q3837801
Similarity Score: 0.8227497
Recommender Run: Recommender Run 3

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Recommended article)
Recommended article: Q3739223
Similarity Score: 0.8226805
Recommender Run: Recommender Run 3