Pages that link to "Item:Q1168734"
From MaRDI portal
The following pages link to Reducibility by algebraic projections (Q1168734):
Displaying 17 items.
- Nonvanishing of Kronecker coefficients for rectangular shapes. (Q549219) (← links)
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (Q923629) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- Succinct representation, leaf languages, and projection reductions (Q1271623) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- Gap-languages and log-time complexity classes (Q1389651) (← links)
- Functions computable in polynomial space (Q1775891) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- On \(\epsilon\)-sensitive monotone computations (Q2198153) (← links)
- Polynomial size linear programs for problems in \textsc{P} (Q2312647) (← links)
- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity (Q3392953) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- Sparktope: linear programs from algorithms (Q5043848) (← links)
- A probabilistic algorithm to test local algebraic observability in polynomial time (Q5894826) (← links)
