The following pages link to Vladimir V. Podolskii (Q413294):
Displaying 35 items.
- (Q368233) (redirect page) (← links)
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- Exponential lower bound for bounded depth circuits with few threshold gates (Q413295) (← links)
- Perceptrons of large weight (Q734289) (← links)
- Tropical combinatorial Nullstellensatz and fewnomials testing (Q1679981) (← links)
- Tropical effective primary and dual Nullstellensätze (Q1745195) (← links)
- On the decision tree complexity of threshold functions (Q2095465) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- Tropical combinatorial Nullstellensatz and sparse polynomials (Q2194772) (← links)
- Computing majority by constant depth majority circuits with low fan-in gates (Q2321926) (← links)
- Complexity of tropical and MIN-plus linear prevarieties (Q2353186) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Patience of matrix games (Q2444536) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Degree-uniform lower bound on the weights of polynomials with given sign function (Q2510769) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Polynomial Threshold Functions and Boolean Threshold Circuits (Q2849939) (← links)
- Tropical Effective Primary and Dual Nullstellens"atze (Q2955010) (← links)
- Exponential Lower Bounds and Separation for Query Rewriting (Q3167017) (← links)
- Circuit Complexity Meets Ontology-Based Data Access (Q3194705) (← links)
- Perceptrons of Large Weight (Q3499782) (← links)
- A Uniform Lower Bound on Weights of Perceptrons (Q3503644) (← links)
- Reducing by 1 the degree of a polynomial with fixed sign function can increase exponentially its weight and length (Q3550940) (← links)
- Weights of Exact Threshold Functions (Q3586073) (← links)
- Ontology-Mediated Queries (Q4625649) (← links)
- On the succinctness of query rewriting over shallow ontologies (Q4635642) (← links)
- Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (Q4635814) (← links)
- Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates (Q4636650) (← links)
- Sergei Ivanovich Adian (Q4992047) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- On the Decision Tree Complexity of Threshold Functions (Q5042240) (← links)
- Inner Product and Set Disjointness (Q5862288) (← links)
- (Q5875578) (← links)
- Lower Bound on Weights of Large Degree Threshold Functions (Q5891072) (← links)
- Lower Bound on Weights of Large Degree Threshold Functions (Q5891704) (← links)
