9 research outputs found

    Algorithm analysis through proof complexity

    No full text
    Proof complexity can be a tool for studying the efficiency of algorithms. By proving a single lower bound on the length of certain proofs, we can get running time lower bounds for a wide category of algorithms. We survey the proof complexity literature that adopts this approach relative to two NP-problems: k-clique and 3-coloring

    Algorithmic problems in groups, semigroups and inverse semigroups

    No full text

    Prime Numbers

    No full text

    A

    No full text
    corecore