The following pages link to Nick Fischer (Q1633344):
Displaying 15 items.
- Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours (Q1633345) (← links)
- The computational complexity of plethysm coefficients (Q2027205) (← links)
- Faster minimization of tardy processing time on a single machine (Q2134746) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- (Q6090879) (← links)
- Faster combinatorial \(k\)-clique algorithms (Q6547932) (← links)
- A structural investigation of the approximability of polynomial-time problems (Q6560816) (← links)
- Improved sublinear-time edit distance for preprocessed strings (Q6560818) (← links)
- Deterministic and Las Vegas algorithms for sparse nonnegative convolution (Q6575199) (← links)
- Dynamic dynamic time warping (Q6645354) (← links)
- Faster sublinear-time edit distance (Q6645480) (← links)
- Deterministic sparse pattern matching via the Baur-Strassen theorem (Q6645482) (← links)
- The time complexity of fully sparse matrix multiplication (Q6645537) (← links)
- The effect of sparsity on \(k\)-Dominating Set and related first-order graph properties (Q6645538) (← links)
- Can you solve closest string faster than exhaustive search? (Q6656939) (← links)
