Pages that link to "Item:Q5002674"
From MaRDI portal
The following pages link to Tighter connections between Formula-SAT and shaving logs (Q5002674):
Displaying 8 items.
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
- (Q5090378) (← links)
- (Q5090396) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5874553) (← links)
- A Faster Subquadratic Algorithm for the Longest Common Increasing Subsequence Problem (Q6065393) (← links)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)