Alexander Knop

Available identifiers

Publication	Date of Publication	Type
Adversarial manifold estimation	2024-02-23	Paper
Statistical query complexity of manifold estimation	2023-11-14	Paper
Log-rank and lifting for AND-functions	2023-11-14	Paper
https://portal.mardi4nfdi.de/entity/Q5874198	2023-02-07	Paper
Lower Bounds on OBDD Proofs with Several Orders	2022-12-08	Paper
ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES	2021-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q5121904	2020-09-22	Paper
Proof complexity of systems of (non-deterministic) decision trees and branching programs	2019-10-18	Paper
Strategies for stable merge sorting	2019-10-15	Paper
On the limits of gate elimination	2018-06-06	Paper
On OBDD-based algorithms and proof systems that dynamically change order of variables	2018-04-19	Paper
Complexity of distributions and average-case hardness	2018-04-19	Paper
On the limits of gate elimination	2018-03-21	Paper
Hard satisfiable formulas for splittings by linear combinations	2017-11-15	Paper
Heuristic time hierarchies via hierarchies for sampling distributions	2016-01-11	Paper
Circuit lower bounds for average-case MA	2015-10-20	Paper

This page was built for person: Alexander Knop