The following pages link to Ivan Mihajlin (Q2354590):
Displaying 25 items.
- New lower bounds on circuit size of multi-output functions (Q2354591) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility (Q2800573) (← links)
- Solving 3-Superstring in 3 n/3 Time (Q2849936) (← links)
- A 5n − o(n) Lower Bound on the Circuit Size over U 2 of a Linear Boolean Function (Q2904438) (← links)
- Computing All MOD-Functions Simultaneously (Q2907489) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- Tight Lower Bounds on Graph Embedding Problems (Q4640290) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- Families with Infants (Q4962612) (← links)
- Computation of Hadwiger Number and Related Contraction Problems (Q5065632) (← links)
- (Q5091000) (← links)
- (Q5121900) (← links)
- Families with Infants: A General Approach to Solve Hard Partition Problems (Q5167772) (← links)
- Collapsing Superstring Conjecture (Q5875478) (← links)
- (Q6075924) (← links)
- Toward better depth lower bounds: the XOR-KRW conjecture (Q6115401) (← links)
- Polynomial formulations as a barrier for reduction-based hardness proofs (Q6538655) (← links)
- If Edge Coloring is hard under SETH, then SETH is false (Q6545109) (← links)
- A better-than-\(3\log(n)\) Depth lower bound for De Morgan formulas with restrictions on top gates (Q6568352) (← links)
- CNF encodings of parity (Q6584048) (← links)
- Super-cubic lower bound for generalized Karchmer-Wigderson games (Q6602493) (← links)
- CNF encodings of symmetric functions (Q6635697) (← links)
- Computations with polynomial evaluation oracle: ruling out superlinear SETH-based lower bounds (Q6645432) (← links)
