The following pages link to Alexander E. Andreev (Q1351967):
Displaying 50 items.
- (Q548749) (redirect page) (← links)
- Test recognition (Q548750) (← links)
- On a family of Boolean matrices (Q581405) (← links)
- Very large cliques are easy to detect (Q932700) (← links)
- On a modification of the gradient algorithm (Q1075295) (← links)
- On the number of maximum intervals (Q1079541) (← links)
- The complexity of the realization of subdefinite matrices by gate schemes (Q1101066) (← links)
- A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes (Q1103591) (← links)
- A method for obtaining efficient lower bounds for monotone complexity (Q1112792) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- On linear hashing of binary sets (Q1280345) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- On a formula synthesizing method (Q1358438) (← links)
- A nearly-optimal transfixing set (Q1363972) (← links)
- Complexity of automata evaluating formulas (Q1382592) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Complexity of monotonic functions (Q1820753) (← links)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs (Q1960516) (← links)
- On algorithm complexity (Q2453388) (← links)
- (Q3197329) (← links)
- (Q3222120) (← links)
- On the complexity of realization of partial Boolean functions by circuits of functional elements (Q3360808) (← links)
- (Q3506243) (← links)
- (Q3681959) (← links)
- (Q3688314) (← links)
- (Q3701345) (← links)
- (Q3705361) (← links)
- (Q3735632) (← links)
- A UNIVERSAL PRINCIPLE OF SELF-CORRECTION (Q3735633) (← links)
- (Q3741628) (← links)
- (Q3745768) (← links)
- (Q3772136) (← links)
- (Q3783562) (← links)
- (Q3786412) (← links)
- (Q3824347) (← links)
- Bounds for code length for circuits of functional elements (Q3835753) (← links)
- A new general derandomization method (Q3841044) (← links)
- (Q3948618) (← links)
- (Q3948619) (← links)
- Weak Random Sources, Hitting Sets, and BPP Simulations (Q4268859) (← links)
- (Q4323983) (← links)
- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs (Q4571950) (← links)
- Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness (Q4593942) (← links)
- (Q4726174) (← links)
- (Q4818849) (← links)
- On the complexity of gradient gate circuits (Q4857749) (← links)
- (Q4891058) (← links)
- (Q4938624) (← links)
- Efficient constructions of Hitting Sets for systems of linear functions (Q5048940) (← links)
- (Q5752496) (← links)
