The following pages link to Alexander Knop (Q1635509):
Displaying 14 items.
- On the limits of gate elimination (Q1635510) (← links)
- Hard satisfiable formulas for splittings by linear combinations (Q1680241) (← links)
- Circuit Lower Bounds for Average-Case MA (Q3194723) (← links)
- Heuristic Time Hierarchies via Hierarchies for Sampling Distributions (Q3459861) (← links)
- On the Limits of Gate Elimination (Q4608608) (← links)
- Complexity of Distributions and Average-Case Hardness (Q4636521) (← links)
- On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables (Q4636642) (← links)
- Lower Bounds on OBDD Proofs with Several Orders (Q5056355) (← links)
- (Q5121904) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
- Strategies for Stable Merge Sorting (Q5236262) (← links)
- (Q5874198) (← links)
- Adversarial manifold estimation (Q6118078) (← links)
- Proof complexity of systems of (non-deterministic) decision trees and branching programs (Q6327466) (← links)
