The following pages link to Mikko Koivisto (Q269492):
Displaying 43 items.
- Separating OR, SUM, and XOR circuits (Q269494) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- On finding optimal polytrees (Q500966) (← links)
- A faster tree-decomposition based algorithm for counting linear extensions (Q786030) (← links)
- Optimal 2-constraint satisfaction via sum-product algorithms (Q844150) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Trimmed Moebius inversion and graphs of bounded degree (Q1959390) (← links)
- Learning Bayesian networks with local structure, mixed variables, and exact algorithms (Q2302809) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Algorithms for learning parsimonious context trees (Q2425237) (← links)
- Fast monotone summation over disjoint sets (Q2446070) (← links)
- (Q2810856) (← links)
- Finding Efficient Circuits for Ensemble Computation (Q2843340) (← links)
- (Q2933845) (← links)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- (Q2954983) (← links)
- (Q3093195) (← links)
- The traveling salesman problem in bounded degree graphs (Q3189059) (← links)
- The Travelling Salesman Problem in Bounded Degree Graphs (Q3521919) (← links)
- Fourier meets M\"{o}bius: fast subset convolution (Q3549598) (← links)
- Set Partitioning via Inclusion-Exclusion (Q3558013) (← links)
- Covering and Packing in Linear Space (Q3587422) (← links)
- Counting Paths and Packings in Halves (Q3639276) (← links)
- Partitioning into Sets of Bounded Cardinality (Q3656867) (← links)
- Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs (Q4566709) (← links)
- Dense Subset Sum may be the hardest (Q4601865) (← links)
- Homomorphic Hashing for Sparse Coefficient Extraction (Q4899249) (← links)
- Fast Monotone Summation over Disjoint Sets (Q4899250) (← links)
- (Q4910710) (← links)
- Fast Zeta Transforms for Lattices with Few Irreducibles (Q4962203) (← links)
- A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions (Q5009467) (← links)
- (Q5091007) (← links)
- Parent Assignment Is Hard for the MDL, AIC, and NML Costs (Q5307575) (← links)
- Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm (Q5326549) (← links)
- (Q5417641) (← links)
- (Q5456817) (← links)
- Algorithmic Learning Theory (Q5464521) (← links)
- (Q5743488) (← links)
- Theory Is Forever (Q5894874) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5920155) (← links)
- (Q6059197) (← links)
