Vladimir V. Podolskii

From MaRDI portal
Revision as of 14:15, 11 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Vladimir V. Podolskii to Vladimir V. Podolskii: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:413294

Available identifiers

zbMath Open podolskii.vladimir-vMaRDI QIDQ413294

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q58755782023-02-03Paper
On the decision tree complexity of threshold functions2022-11-16Paper
On the Decision Tree Complexity of Threshold Functions2022-10-19Paper
A tetrachotomy of ontology-mediated queries with a covering axiom2022-07-08Paper
Inner Product and Set Disjointness2022-03-07Paper
Weights of exact threshold functions2022-02-24Paper
Sergei Ivanovich Adian2021-06-04Paper
Tropical combinatorial Nullstellensatz and sparse polynomials2020-09-07Paper
Computing majority by constant depth majority circuits with low fan-in gates2019-08-27Paper
Ontology-Mediated Queries2019-02-25Paper
On the succinctness of query rewriting over shallow ontologies2018-04-23Paper
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results2018-04-23Paper
Tropical effective primary and dual Nullstellensätze2018-04-20Paper
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates2018-04-19Paper
Tropical combinatorial Nullstellensatz and fewnomials testing2017-11-22Paper
Bounds in ontology-based data access via circuit complexity2017-10-20Paper
Tropical Effective Primary and Dual Nullstellens"atze2017-01-24Paper
Circuit Complexity Meets Ontology-Based Data Access2015-10-20Paper
Complexity of tropical and MIN-plus linear prevarieties2015-07-08Paper
Polynomial threshold functions and Boolean threshold circuits2015-01-30Paper
Degree-uniform lower bound on the weights of polynomials with given sign function2014-08-04Paper
The price of query rewriting in ontology-based data access2014-06-10Paper
Patience of matrix games2014-04-10Paper
Polynomial Threshold Functions and Boolean Threshold Circuits2013-09-20Paper
A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length2013-09-18Paper
Lower Bound on Weights of Large Degree Threshold Functions2013-07-09Paper
Exponential Lower Bounds and Separation for Query Rewriting2012-11-01Paper
Lower Bound on Weights of Large Degree Threshold Functions2012-08-14Paper
Exponential lower bound for bounded depth circuits with few threshold gates2012-05-04Paper
Weights of Exact Threshold Functions2010-09-03Paper
Reducing by 1 the degree of a polynomial with fixed sign function can increase exponentially its weight and length2010-04-08Paper
Perceptrons of large weight2009-10-20Paper
A Uniform Lower Bound on Weights of Perceptrons2008-06-05Paper
Perceptrons of Large Weight2008-06-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Vladimir V. Podolskii