Skip to content

niche computing science

Publications
Research Blog
Teaching
Search

Search for:

Algebraic Methods for Optimisation Problems (Transfering dissertation)

June 20, 2007 February 13, 2010 / Leave a Comment

Post navigation

← Previous Post

Leave a Comment Cancel Reply

Your email address will not be published. Required fields are marked *

Type here..

Name*

Email*

Website

Save my name, email, and website in this browser for the next time I comment.

Δ

中文訪客請參觀小眾計算學!

Research

Adjoint Functors Adjunction Agda Approximation Backtracking Bidirectional Updating Burrows-Wheeler Transform Concurrency Converse-of-a-Function Theorem Curry-Howard Data Structure Dependent Type Effect Fibonacci GADT Galois Connection Generic Datatype Greedy Theorem Haskell HaXML Imperative Programs Indirect Equality Inductive Proof List Homomorphism Logic Logic Programming Monad n-Queens Non-determinism Optimisation Problems Partitioning Problems Program Derivation Program Inversion Quantum Programming Quicksort Quine Regular Expression Relation Segment Problems State Termination Thinning Theorem Types XML Streaming λ calculus

Recent Comments

Zack on Declarative pearl: deriving monadic quicksort
最大信用問題 — 一個區段問題的例子 – 小眾計算學 on The Maximum Segment Sum Problem: Its Origin, and a Derivation
Shin on Evaluating Simple Polynomials
Ben Franksen on Evaluating Simple Polynomials
程式推導範例：快速排序 (Quicksort)與快速選擇 (Quickselect) | on The Maximum Segment Sum Problem: Its Origin, and a Derivation

Copyright © 2025 niche computing science | Powered by Astra WordPress Theme