| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7650250 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
On the decision tree complexity of threshold functions
Theory of Computing Systems | 2022-11-16 | Paper |
On the Decision Tree Complexity of Threshold Functions
Computer Science – Theory and Applications | 2022-10-19 | Paper |
A tetrachotomy of ontology-mediated queries with a covering axiom
Artificial Intelligence | 2022-07-08 | Paper |
Inner product and set disjointness: beyond logarithmically many parties
ACM Transactions on Computation Theory | 2022-03-07 | Paper |
Weights of exact threshold functions
Izvestiya: Mathematics | 2022-02-24 | Paper |
Sergei Ivanovich Adian
Russian Mathematical Surveys | 2021-06-04 | Paper |
Tropical combinatorial Nullstellensatz and sparse polynomials
Foundations of Computational Mathematics | 2020-09-07 | Paper |
Computing majority by constant depth majority circuits with low fan-in gates
Theory of Computing Systems | 2019-08-27 | Paper |
Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
Journal of the ACM | 2019-02-25 | Paper |
On the succinctness of query rewriting over shallow ontologies
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
On the succinctness of query rewriting over shallow ontologies
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Tree-like queries in OWL 2 QL: succinctness and complexity results
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
Tropical effective primary and dual Nullstellensätze
Discrete & Computational Geometry | 2018-04-20 | Paper |
Tropical effective primary and dual Nullstellensätze
Discrete & Computational Geometry | 2018-04-20 | Paper |
Computing majority by constant depth majority circuits with low fan-in gates
(available as arXiv preprint) | 2018-04-19 | Paper |
| Tropical combinatorial Nullstellensatz and fewnomials testing | 2017-11-22 | Paper |
Bounds in ontology-based data access via circuit complexity
Theory of Computing Systems | 2017-10-20 | Paper |
| Tropical effective primary and dual Nullstellensätze | 2017-01-24 | Paper |
Circuit complexity meets ontology-based data access
Lecture Notes in Computer Science | 2015-10-20 | Paper |
Complexity of tropical and MIN-plus linear prevarieties
Computational Complexity | 2015-07-08 | Paper |
Polynomial threshold functions and Boolean threshold circuits
Information and Computation | 2015-01-30 | Paper |
Degree-uniform lower bound on the weights of polynomials with given sign function
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
The price of query rewriting in ontology-based data access
Artificial Intelligence | 2014-06-10 | Paper |
Patience of matrix games
Discrete Applied Mathematics | 2014-04-10 | Paper |
Polynomial threshold functions and Boolean threshold circuits
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
Mathematical Notes | 2013-09-18 | Paper |
Lower bound on weights of large degree threshold functions
Logical Methods in Computer Science | 2013-07-09 | Paper |
Exponential lower bounds and separation for query rewriting
Automata, Languages, and Programming | 2012-11-01 | Paper |
Exponential lower bounds and separation for query rewriting
Automata, Languages, and Programming | 2012-11-01 | Paper |
Lower bound on weights of large degree threshold functions
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Exponential lower bound for bounded depth circuits with few threshold gates
Information Processing Letters | 2012-05-04 | Paper |
Weights of exact threshold functions
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
Reducing by 1 the degree of a polynomial with fixed sign function can increase exponentially its weight and length
Russian Mathematical Surveys | 2010-04-08 | Paper |
Perceptrons of large weight
Problems of Information Transmission | 2009-10-20 | Paper |
A Uniform Lower Bound on Weights of Perceptrons
Computer Science – Theory and Applications | 2008-06-05 | Paper |
Perceptrons of Large Weight
Computer Science – Theory and Applications | 2008-06-03 | Paper |
