Pages that link to "Item:Q3990101"
From MaRDI portal
The following pages link to Computing Algebraic Formulas Using a Constant Number of Registers (Q3990101):
Displayed 43 items.
- On the power of algebraic branching programs of width two (Q260398) (← links)
- Geometric aspects of iterated matrix multiplication (Q298019) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- Towards optimal simulations of formulas by bounded-width programs (Q685723) (← links)
- On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (Q987381) (← links)
- Nondeterministic \(NC^1\) computation (Q1276170) (← links)
- An infinite pebble game and applications (Q1362906) (← links)
- Efficient oblivious branching programs for threshold and mod functions (Q1384527) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) (Q1759656) (← links)
- Functions computable in polynomial space (Q1775891) (← links)
- A note on logspace optimization (Q1904668) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Better complexity bounds for cost register automata (Q1999991) (← links)
- On measures of space over real and complex numbers (Q2019497) (← links)
- Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
- Limitations of sums of bounded read formulas and ABPs (Q2117084) (← links)
- A note on VNP-completeness and border complexity (Q2122788) (← links)
- Efficient information-theoretic multi-party computation over non-commutative rings (Q2128567) (← links)
- Average-case linear matrix factorization and reconstruction of low width algebraic branching programs (Q2281256) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- Complexity of regular functions (Q2424670) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Secure Protocol Transformations (Q2829224) (← links)
- Uniform derandomization from pathetic lower bounds (Q2941601) (← links)
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
- On the Power of Algebraic Branching Programs of Width Two (Q3012846) (← links)
- Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity (Q3392953) (← links)
- Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae (Q3599149) (← links)
- Interleaved Group Products (Q4634030) (← links)
- (Q4638074) (← links)
- Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- (Q5092471) (← links)
- Better complexity bounds for cost register automata (Q5111238) (← links)
- Rational subsets of unitriangular groups (Q5246506) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols (Q5744697) (← links)
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring (Q5889792) (← links)
- Dimension of tensor network varieties (Q6076393) (← links)