Alexander E. Andreev

Available identifiers

zbMath Open andreev.alexander-eWikidataQ2642109 ScholiaQ2642109MaRDI QIDQ1351967

List of research outcomes

Publication	Date of Publication	Type
The parallel complexity of approximating the High Degree Subgraph problem	2023-03-21	Paper
Efficient constructions of Hitting Sets for systems of linear functions	2022-11-09	Paper
Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs	2018-07-04	Paper
Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness	2017-11-16	Paper
On algorithm complexity	2014-06-06	Paper
Test recognition	2011-06-30	Paper
Very large cliques are easy to detect	2008-07-11	Paper
https://portal.mardi4nfdi.de/entity/Q3506243	2008-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q4818849	2004-09-24	Paper
https://portal.mardi4nfdi.de/entity/Q4938624	2000-07-10	Paper
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs	2000-01-12	Paper
Weak Random Sources, Hitting Sets, and BPP Simulations	1999-10-28	Paper
On linear hashing of binary sets	1999-03-15	Paper
The parallel complexity of approximating the high degree subgraph problem	1999-01-12	Paper
A new general derandomization method	1999-01-05	Paper
Optimal bounds for the approximation of Boolean functions and some applications	1998-07-22	Paper
Complexity of automata evaluating formulas	1998-03-29	Paper
A nearly-optimal transfixing set	1998-03-11	Paper
On a formula synthesizing method	1997-07-01	Paper
Statistical estimation of the structure of a finite population	1997-03-23	Paper
Statistical estimation of the structure of a finite population	1997-03-23	Paper
Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)	1997-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4891058	1996-08-27	Paper
On the complexity of gradient gate circuits	1996-01-15	Paper
Bounds for code length for circuits of functional elements	1995-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q4323983	1995-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q3197329	1991-01-01	Paper
On the complexity of realization of partial Boolean functions by circuits of functional elements	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5752496	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3824347	1988-01-01	Paper
The complexity of the realization of subdefinite matrices by gate schemes	1987-01-01	Paper
A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes	1987-01-01	Paper
A method for obtaining efficient lower bounds for monotone complexity	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3772136	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3783562	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3786412	1987-01-01	Paper
On a family of Boolean matrices	1986-01-01	Paper
A UNIVERSAL PRINCIPLE OF SELF-CORRECTION	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3741628	1986-01-01	Paper
On a modification of the gradient algorithm	1985-01-01	Paper
On the number of maximum intervals	1985-01-01	Paper
Complexity of monotonic functions	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3688314	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3701345	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3745768	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4726174	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3681959	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3705361	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3735632	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3222120	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3948619	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3948618	1980-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Alexander E. Andreev