Sökning: "maximum complexity"

Visar resultat 1 - 5 av 168 avhandlingar innehållade orden maximum complexity.

  1. 1. Space in Proof Complexity

    Författare :Marc Vinyals; Jakob Nordström; Yehudayoff Amir; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; proof complexity; resolution; polynomial calculus; cutting planes; space complexity; computational complexity; pebble games; communication complexity; CDCL; Computer Science; Datalogi;

    Sammanfattning : ropositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter.Different approaches to reasoning are captured by corresponding proof systems. LÄS MER

  3. 2. Constructing Evolutionary Trees - Algorithms and Complexity

    Författare :Anna Östlin; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Maximum homeomorphic subtrees; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

    Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER

  4. 3. On Some Combinatorial Optimization Problems : Algorithms and Complexity

    Författare :Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

    Sammanfattning : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). LÄS MER

  5. 4. Lower Bounds and Trade-offs in Proof Complexity

    Författare :Susanna F. de Rezende; Jakob Nordström; Amit Chakrabarti; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Proof complexity; trade-offs; lower bounds; size; length; space; Computer Science; Datalogi;

    Sammanfattning : Propositional proof complexity is a field in theoretical computer science that analyses the resources needed to prove statements. In this thesis, we are concerned about the length of proofs and trade-offs between different resources, such as length and space. LÄS MER

  7. 5. Komplexitetsmax

    Författare :Christer Hoberg; Bo Göranzon; Jörn Messeter; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; dialogue seminar method; reflection; skills; maximum complexity; Work sciences and ergonomics; Arbetsvetenskap och ergonomi;

    Sammanfattning : This study explores the development of an engineering praxis as a result of a cooperation between an engineering company and the programme KTH Advanced Programme in Reflective Practice of the research area of Skill and technology at the Royal Institute of Technology (KTH) in Stockholm. The dialogue seminar method has been used and taken as a starting point for the dialogue in groups of engineers. LÄS MER