Search
Now showing items 31-40 of 170
Abelovské a silně abelovské algebry
Abelian and strongly abelian algebras
bachelor thesis (DEFENDED)
Advisor: Stanovský, David
Date Issued: 2010
Date of defense: 10. 09. 2010
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Důkaz s nulovou znalostí pro isomorfismus grafů
Zero-knowledge proofs of graph isomorphism
bachelor thesis (DEFENDED)
Advisor: Holub, Štěpán
Date Issued: 2008
Date of defense: 09. 09. 2008
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Kryptografické využití grupy kvadratických residuí
The Group of Quadratic Residues in Cryptography
bachelor thesis (DEFENDED)
Advisor: Holub, Štěpán
Date Issued: 2010
Date of defense: 09. 09. 2010
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Algoritmy dokazující prvočíselnost
Algortihms for proving primality
bachelor thesis (DEFENDED)
Advisor: Šťovíček, Jan
Date Issued: 2016
Date of defense: 28. 06. 2016
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Cílem práce je seznámit čtenáře s různými algoritmy pro dokazování prvočíselnosti spolu s použitím některých těchto algoritmů v praxi. Práce je za- měřena na Goldwasser-Killianův test, jehož výstupem je certifikát, který ...
The goal of the thesis is introducing the reader to some of the algori- thms for proving primality along with practical usage of some of these algorithms. The main objective of the thesis is a presentation of Goldwasser-Killian ...
The goal of the thesis is introducing the reader to some of the algori- thms for proving primality along with practical usage of some of these algorithms. The main objective of the thesis is a presentation of Goldwasser-Killian ...
Homomorfní šifrovací schémata
Homomorphic encryption schemes
bachelor thesis (DEFENDED)
Advisor: Kazda, Alexandr
Date Issued: 2013
Date of defense: 24. 06. 2013
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: Název práce: Homomorfní šifrovací schémata Autor: Anežka Titěrová Katedra: Katedra algebry Vedoucí bakalářské práce: RNDr. Alexandr Kazda, Katedra algebry Abstrakt: V roce 1978 publikoval Rivest a kol. kryptografický ...
Title: Homomorphic encryption schemes Author: Anežka Titěrová Department: Department of Algebra Supervisor: RNDr. Alexandr Kazda, Department of Algebra Abstract: Rivest et al. posed in 1978 the cryptographic problem how ...
Title: Homomorphic encryption schemes Author: Anežka Titěrová Department: Department of Algebra Supervisor: RNDr. Alexandr Kazda, Department of Algebra Abstract: Rivest et al. posed in 1978 the cryptographic problem how ...
Algebraická entropie
Algebraic entropy
bachelor thesis (DEFENDED)
Advisor: Žemlička, Jan
Date Issued: 2010
Date of defense: 25. 06. 2010
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Max okruhy
Max rings
bachelor thesis (DEFENDED)
Advisor: Žemlička, Jan
Date Issued: 2019
Date of defense: 21. 06. 2019
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: V této práci se zabýváme max okruhy, což jsou okruhy, u kterých každý mo- dul má maximální podmodul. Nejprve dokazujeme charakterizaci komutativních okruhů jako okruhů s T-nilpotentním Jacobsonovým radikálem a von Neuman- ...
Topic of this thesis is max rings, which are the rings, whose nonzero modu- les have maximal submodules. At the begining we prove a characterization of commutative max rings as rings with T-nilpotent Jacobson radical and ...
Topic of this thesis is max rings, which are the rings, whose nonzero modu- les have maximal submodules. At the begining we prove a characterization of commutative max rings as rings with T-nilpotent Jacobson radical and ...
Konstrukce modelů pomocí CSP
Model building using CSP
bachelor thesis (DEFENDED)
Advisor: Stanovský, David
Date Issued: 2011
Date of defense: 23. 06. 2011
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: V této práci se věnujeme algoritmům na konstrukci konečných modelů pro množiny axiomů logiky 1. řádu s cílem navrhnout a implementovat novou metodu, založenou na převodu na problém splnitelnosti omezení (CSP). V teoretické ...
In the present work, we study algorithms for building finite models of sets of first-order axioms with the aim of proposing and implementing a new method, based on translation onto constraint satisfaction problem (CSP). ...
In the present work, we study algorithms for building finite models of sets of first-order axioms with the aim of proposing and implementing a new method, based on translation onto constraint satisfaction problem (CSP). ...
Dělitelnost v oborech integrity
Divisibility in integral domains
bachelor thesis (DEFENDED)
Advisor: Růžička, Pavel
Date Issued: 2008
Date of defense: 19. 09. 2008
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract not found
Důkazy pomocí konečných automatů
Proving by finite automata
diploma thesis (DEFENDED)
Advisor: Holub, Štěpán
Date Issued: 2017
Date of defense: 13. 09. 2017
Faculty / Institute: Matematicko-fyzikální fakulta / Faculty of Mathematics and Physics
Abstract: V roce 2016 zveřejnil Hamoon Mousavi program Walnut implementující automatické dokazování vět o automatických posloupnostech. Hlavním cílem této práce bylo ukázat teoretickou funkčnost Walnutu na základě spojitosti ...
In 2016, Hamoon Mousavi published Walnut which is a program that implements automated theorem proving of propositions about automatic sequences. The main purpose of this thesis was to show the theoretical functi- onality ...
In 2016, Hamoon Mousavi published Walnut which is a program that implements automated theorem proving of propositions about automatic sequences. The main purpose of this thesis was to show the theoretical functi- onality ...