Log in

Relevant bibliographies by topics / Binary Quadratic / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Binary Quadratic.

Dissertations / Theses on the topic 'Binary Quadratic'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 31 dissertations / theses for your research on the topic 'Binary Quadratic.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Bettiol, Enrico. "Column generation methods for quadratic mixed binary programming." Thesis, Paris 13, 2019. http://www.theses.fr/2019PA131073.

Full text

Abstract:

La programmation non linéaire mixte peut modéliser un grand nombre de problèmes réels. Cependant, ces problèmes peuvent contenir de nombreuses variables ou contraintes, il convient donc de proposer des méthodes de décomposition afin de les résoudre efficacement. Parmi ces techniques on peut citer la génération de colonnes et notamment la décomposition de Dantzig-Wolfe. Il s’agit d’une reformulation du problème original, qui permet de générer une séquence de sous-problèmes plus simples, appelés maître etpricing, pour obtenir la valeur optimale. Développée d’abord pour les problèmes linéaires, l

APA, Harvard, Vancouver, ISO, and other styles

2

Pintore, Federico. "Binary quadratic forms, elliptic curves and Schoof's algorithm." Doctoral thesis, Università degli studi di Trento, 2015. https://hdl.handle.net/11572/367967.

Full text

Abstract:

In this thesis, I show that the representation of prime integers by reduced binary quadratic forms of given discriminant can be obtained in polynomial complexity using Schoof's algorithm for counting the number of points of elliptic curves over finite fields. It is a remarkable fact that, although an algorithm of Gauss' solved the representation problem long time ago, a solution in polynomial complexity is very recent and almost unnoticed in the literature. Further, I present a viable alternative to Gauss' algorithm, which constitutes the main original contribution of my thesis. This alternati

APA, Harvard, Vancouver, ISO, and other styles

3

Pintore, Federico. "Binary quadratic forms, elliptic curves and Schoof's algorithm." Doctoral thesis, University of Trento, 2015. http://eprints-phd.biblio.unitn.it/1449/1/PhD_Thesis_-_Federico_Pintore.pdf.

Full text

Abstract:

In this thesis, I show that the representation of prime integers by reduced binary quadratic forms of given discriminant can be obtained in polynomial complexity using Schoof's algorithm for counting the number of points of elliptic curves over finite fields. It is a remarkable fact that, although an algorithm of Gauss' solved the representation problem long time ago, a solution in polynomial complexity is very recent and almost unnoticed in the literature. Further, I present a viable alternative to Gauss' algorithm, which constitutes the main original contribution of my thesis. This alternati

APA, Harvard, Vancouver, ISO, and other styles

4

Beyerl, Jeffrey J. "Binary quadratic forms over F[T] and principal ideal domains." Connect to this title online, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Liu, Dunxue Carleton University Dissertation Mathematics. "Dihedral polynomial congruences and binary quadratic forms: a class field theory approach." Ottawa, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Tempesta, Patricia. "Simmetries in binary differential equations." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55135/tde-11072017-170308/.

Full text

Abstract:

The purpose of this thesis in to introduce the systematic study of symmetries in binary differential equations (BDEs). We formalize the concept of a symmetric BDE, under the linear action of a compact Lie group. One of the main results establishes a formula that relates the algebraic and geometric effects of the occurrence of the symmetry in the problem. Using tools from invariant theory and representation theory for compact Lie groups we deduce the general forms of equivariant binary differential equations under compact subgroups of O(2). A study about the behavior of the invariant straight l

APA, Harvard, Vancouver, ISO, and other styles

7

Miller, Nicole Renee. "The Structure of the Class Group of Imaginary Quadratic Fields." Thesis, Virginia Tech, 2005. http://hdl.handle.net/10919/32572.

Full text

Abstract:

Let $Q(\sqrt{-d})$ be an imaginary quadratic field with discriminant $\Delta$. We use the isomorphism between the ideal class groups of the field and the equivalence classes of binary quadratic forms to find the structure of the class group. We determine the structure by combining two of Shanks' algorithms [7, 8]. We utilize this method to find fields with cyclic factors that have order a large power of 2, or fields with class groups of high 5-ranks or high 7-ranks.<br>Master of Science

APA, Harvard, Vancouver, ISO, and other styles

8

Battikh, Rabih. "La résοlutiοn de prοblème quadratique binaire par des méthοdes d'οptimisatiοn exactes et apprοchées". Electronic Thesis or Diss., Normandie, 2024. http://www.theses.fr/2024NORMLH20.

Full text

Abstract:

Dans cette thèse, nous avons présenté un nouvel algorithme hybride (HA) pour la résolution du problème (UQP). Cet algorithme est basé sur la combinaison d'un bloc de cinq procédures spéciales et de la méthode du recuit simulé. Nos procédures sont très efficaces et rapides, mais malheureusement, parfois elles sont bloquées par un minimum local. Pour surmonter cet inconvénient, nous les avons combinées avec un algorithme de recuit simulé. Ensuite, nous avons répété ces procédures plusieurs fois pour obtenir la meilleure solution en utilisant notre algorithme hybride.Nous avons remarqué que l'éca

APA, Harvard, Vancouver, ISO, and other styles

9

in, dani@math tifr res. "On Orbits of SL(2,Z)$_+$ and Values of Binary Quadratic Forms on Positive Integral Pairs." ESI preprints, 2001. ftp://ftp.esi.ac.at/pub/Preprints/esi1050.ps.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Constable, Jonathan A. "Kronecker's Theory of Binary Bilinear Forms with Applications to Representations of Integers as Sums of Three Squares." UKnowledge, 2016. http://uknowledge.uky.edu/math_etds/35.

Full text

Abstract:

In 1883 Leopold Kronecker published a paper containing “a few explanatory remarks” to an earlier paper of his from 1866. His work loosely connected the theory of integral binary bilinear forms to the theory of integral binary quadratic forms. In this dissertation we discover the statements within Kronecker's paper and offer detailed arithmetic proofs. We begin by developing the theory of binary bilinear forms and their automorphs, providing a classification of integral binary bilinear forms up to equivalence, proper equivalence and complete equivalence. In the second chapter we introduce the c

APA, Harvard, Vancouver, ISO, and other styles

11

CIRILLO, GIOVANNI AMEDEO. "Engineering quantum computing technologies: from compact modelling to applications." Doctoral thesis, Politecnico di Torino, 2022. http://hdl.handle.net/11583/2971119.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Domingos, Neto Adriano. "Propostas de codigos ortogonais para sistemas OCDMA." [s.n.], 2005. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260517.

Full text

Abstract:

Orientador: Edson Moschim<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-04T21:57:49Z (GMT). No. of bitstreams: 1 DomingosNeto_Adriano_D.pdf: 1544823 bytes, checksum: f09f4717b59d1cce526b7c8746e53efb (MD5) Previous issue date: 2005<br>Resumo: Nesta tese, propõe se três novas construções de códigos ortogonais ópticos (OOC), do tipo congruentes, tendo como base a estrutura algébrica do grupo multiplicativo do corpo de Galois GF(p), para aplicação em sistemas de comunicação utilizando a técnica de

APA, Harvard, Vancouver, ISO, and other styles

13

Brommer, Peter. "Development and test of interaction potentials for complex metallic alloys Entwicklung und Test von Wechselwirkungspotenzialen für komplexe intermetallische Verbindungen /." [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-34105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Shih, Pei-Yu, and 施沛渝. "Algebraic Decoding of Binary Quadratic Residue Codes." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/07359442805649730436.

Full text

Abstract:

博士<br>義守大學<br>資訊工程學系博士班<br>97<br>Binary quadratic residue codes are among the most powerful known block codes. This dissertation is focused on the topics of algebraic decoding of binary quadratic residue codes. Two new algebraic decoding schemes for the binary quadratic residue codes are proposed. The key ideals behind these two decoding techniques are the utilization of the inverse-free Berlekamp-Massey algorithm and syndrome polynomial, respectively. In this research, based on ideas of the decoding algorithm suggested by Truong et al. for some quadratic residue codes with irreducible genera

APA, Harvard, Vancouver, ISO, and other styles

15

Wu, Yi-sheng, and 吳義聖. "The Minimum Distances of some Binary Quadratic Residue Codes." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/32921587385004644680.

Full text

Abstract:

碩士<br>義守大學<br>資訊工程學系碩士班<br>97<br>The minimum distances of Quadratic Residue (QR) Codes are the significant factor to determine their ability of error correction and detection. However, the determination of the minimum distance of a QR-Code is not an easy task. Extremely large scale of computation will be required to achieve this goal for some long-codeword-length QR-Codes, which means the work is going to take a very long time to accomplish. Hence, there are several efficient approaches have been developed for speeding up the process. In this paper, the minimum distances of Binary Extended Qua

APA, Harvard, Vancouver, ISO, and other styles

16

Chen, Yan-Haw, and 陳延華. "A New Algorithm for Decoding Binary Quadratic Residue Codes." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/72111650752946177167.

Full text

Abstract:

博士<br>義守大學<br>電機工程學系博士班<br>94<br>In this dissertation, an algebraic decoding method is proposed for the quadratic residue codes that utilize the Berlekamp-Massey algorithm. By a modification of the technique mentioned by Ruhua et al, one can express the unknown syndromes as functions of the known syndromes. The unknown syndromes are determined by an efficient algorithm also developed in this dissertation. With the appearance of unknown syndromes, one obtains the consecutive syndromes needed for the application of the Berlekamp-Massey algorithm. The new decoding scheme, developed here, is easi

APA, Harvard, Vancouver, ISO, and other styles

17

Su, Wen-ku, and 蘇文谷. "On Decoding and Weight Distributions of Binary Quadratic Residue Codes." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/45490783837892298208.

Full text

Abstract:

博士<br>義守大學<br>資訊工程學系博士班<br>97<br>Binary quadratic residue codes are among the most powerful known block codes. This dissertation is focused on the topics of decoding and weight distributions of binary quadratic residue codes. Two new decoding schemes for binary quadratic residue codes are proposed. The key ideal behind the first decoding technique is the utilization of the inverse-free Berlekamp-Massey algorithm. In this research, based on ideas of the decoding algorithm suggested by Truong et al. for some quadratic residue codes with irreducible generating polynomials, an algebraic decoder fo

APA, Harvard, Vancouver, ISO, and other styles

18

Huang, Ching-Fu, and 黃慶福. "Decoding of Some Binary Quadratic Residue Codes with Hash Table." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/36577938964090437596.

Full text

Abstract:

博士<br>義守大學<br>資訊工程學系<br>104<br>In computer science, Lookup-table (LUT)-based method is an array that replaces runtime computation with a simpler array indexing operation. The savings in terms of processing time can be significant, since retrieving a value from memory is often faster than undergoing an ''expensive'' computation or input/output operation. In this dissertation, we present several new designs for table-based function evaluation and table-based error correcting coding. In Chapter 3, present an efficient table lookup algorithm for high-throughput decoding of the (71, 36, 11) quadrat

APA, Harvard, Vancouver, ISO, and other styles

19

Lee, Chong-Dao, and 李崇道. "Algebraic Decoding and Weight Distributions of Binary Quadratic Residue Codes." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/95727221540586146150.

Full text

Abstract:

博士<br>義守大學<br>資訊工程學系博士班<br>94<br>Binary quadratic residue codes are among the most powerful known block codes. This dissertation is focused on the topics of algebraic decoding and weight distributions of binary quadratic residue codes. Two new algebraic decoding schemes for binary quadratic residue codes are proposed. The key ideals behind the decoding techniques are the utilization of the inverse-free Berlekamp-Massey algorithm and syndrome polynomial. The new decoding schemes are not only easier to implement than the previous ones, but also able to serve as a useful decoding for many other b

APA, Harvard, Vancouver, ISO, and other styles

20

Charters, Philippa Liana. "Generalizing binary quadratic residue codes to higher power residues over larger fields." 2009. http://hdl.handle.net/2152/11667.

Full text

Abstract:

In this paper, we provide a generalization of binary quadratic residue codes to the cases of higher power prime residues over the finite field of the same order, which we will call qth power residue codes. We find generating polynomials for such codes, define a new notion corresponding to the binary concept of an idempotent, and use this to find square root lower bound for the codeword weight of the duals of such codes, which leads to a lower bound on the weight of the codewords themselves. In addition, we construct a family of asymptotically bad qth power residue codes.<br>text

APA, Harvard, Vancouver, ISO, and other styles

21

Lee, Chond-Dao, and 李崇道. "The Implementation of Binary (89,45,17) Quadratic Residue Code up to Five Errors." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/79538084115213657630.

Full text

Abstract:

碩士<br>義守大學<br>資訊工程學系<br>89<br>The main purpose of this thesis is, by applying a new algebraic decoding method used by R. He et al [1] to develop an algorithm for decoding the binary (89, 45, 17) code up to five errors. The original algebraic decoding method is applying Sylvester resultant to reduce the unknowns and to solve the nonlinear multivariate equations in the Newton identities. The new method is to use a matrix-determinant technique to produce phantom-relations of unknowns as auxiliary equations. This will add the number of equations that are needed to solve the error-locator polynomia

APA, Harvard, Vancouver, ISO, and other styles

22

Lee, Hung-Peng, and 李鴻鵬. "High speed decoding of the binary (47, 24, 11) quadratic residue code." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/66749928891749710209.

Full text

Abstract:

博士<br>義守大學<br>資訊工程學系博士班<br>99<br>In this dissertation, an efficient table lookup decoding algorithm (TLDA) is presented to correct up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main idea of the TLDA is based on the weight of syndrome, the syndrome decoder together with a reduced-size lookup table (RSLT), and the shift-search method given by Reed et al. Thus, the size of the lookup table and computational complexity in a finite field can be significantly reduced. The memory size of the proposed condensed lookup table (CLT) consists of only 36.6

APA, Harvard, Vancouver, ISO, and other styles

23

Chen, Zih-Heng, and 陳資衡. "Arithmetic Decoding Algorithm for Binary Quadratic Residue Codes Using Syndrome-Weight Determination." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/19388682862799593658.

Full text

Abstract:

博士<br>義守大學<br>資訊工程學系博士班<br>99<br>In communication systems, the data transmitted through a noisy channel might be corrupted so that it must be protected by error-correcting code to guarantee the decoded data same as the original data. If the communication channels have diffident purposes, diffident encoding and decoding schemes are selected. For example, the long code (e.g. LDPC code) is applied to DVB-S, and the short code (e.g. Hamming code) is applied to flash memory. The quadratic residue (QR) codes have the characteristic of relative large minimum distances when the length of codeword is l

APA, Harvard, Vancouver, ISO, and other styles

24

O, Pai-Kuei, and 歐百貴. "Formulate Searching for Trend-Free Block Designs as a Quadratic Binary Optimization Problem." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/v2nc3a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Dahl, Alexander Oswald. "On Moments of Class Numbers of Real Quadratic Fields." Thesis, 2010. http://hdl.handle.net/1807/24553.

Full text

Abstract:

Class numbers of algebraic number fields are central invariants. Once the underlying field has an infinite unit group they behave very irregularly due to a non-trivial regulator. This phenomenon occurs already in the simplest case of real quadratic number fields of which very little is known. Hooley derived a conjectural formula for the average of class numbers of real quadratic fields. In this thesis we extend his methods to obtain conjectural formulae and bounds for any moment, i.e., the average of an arbitrary real power of class numbers. Our formulae and bounds are based on similar (quite

APA, Harvard, Vancouver, ISO, and other styles

26

黎敬凡. "A continuation approach for solving binary quadratic program based on generalized Fischer-Burmeister function." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/31790910678589194385.

Full text

Abstract:

碩士<br>國立臺灣師範大學<br>數學系<br>99<br>In the paper, we consider a continuation approach for the binary quadratic program(BQP) based on the generalized Fischer-Burmeister function. More specically, we recast the BQP as an equivalent minimization and then seeks its global minimizer via a global continuation method. Such approach had been considered in [8] which is based on the Fischer-Burmeister function. We investigate this continuation approach again by using a more general function, called the generalized Fischer-Burmeister function.

APA, Harvard, Vancouver, ISO, and other styles

27

Tavares, Gabriel. "New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences." 2008. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000051095.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

(10732485), Clinton W. Bradford. "Square Forms Factoring with Sieves." Thesis, 2021.

Find full text

Abstract:

Square Form Factoring is an <i>O</i>(<i>N</i><sup>1/4</sup>) factoring algorithm developed by D. Shanks using certain properties of quadratic forms. Central to the original algorithm is an iterative search for a square form. We propose a new subexponential-time algorithm called SQUFOF2, based on ideas of D. Shanks and R. de Vogelaire, which replaces the iterative search with a sieve, similar to the Quadratic Sieve.

APA, Harvard, Vancouver, ISO, and other styles

29

Zemková, Kristýna. "Skládání kvadratických forem nad číselnými tělesy." Master's thesis, 2018. http://www.nusl.cz/ntk/nusl-383320.

Full text

Abstract:

The thesis is concerned with the theory of binary quadratic forms with coefficients in the ring of algebraic integers of a number field. Under the assumption that the number field is of narrow class number one, there is developed a theory of composition of such quadratic forms. For a given discriminant, the composition is determined by a bijection between classes of quadratic forms and a so-called relative oriented class group (a group closely related to the class group). Furthermore, Bhargava cubes are generalized to cubes with entries from the ring of algebraic integers; by using the composi

APA, Harvard, Vancouver, ISO, and other styles

30

Gomes, Cláudio Filipe Prata. "Portfolio Optimization in Financial Markets using Quantum Computing: An Experimental Study." Master's thesis, 2021. http://hdl.handle.net/10316/96124.

Full text

Abstract:

Dissertação de Mestrado em Engenharia Informática apresentada à Faculdade de Ciências e Tecnologia<br>A computação quântica está prestes a mudar o mundo tal como o conhecemos. Através da exploração das propriedades da teoria quântica para fins computacionais, é esperada uma redução substancial na quantidade de problemas que hoje são considerados intratáveis. Isto significa que os computadores quânticos têm a capacidade de devolver soluções para alguns problemas de interesse prático para os quais um computador clássico não consegue devolver, pelo menos em tempo útil. Isto é ainda mais revolucio

APA, Harvard, Vancouver, ISO, and other styles

31

Silva, Pedro Miguel Dias da. "Quantum Computing for Optimizing Power Flow in Energy Grids." Master's thesis, 2021. http://hdl.handle.net/10316/98073.

Full text

Abstract:

Dissertação de Mestrado em Engenharia Informática apresentada à Faculdade de Ciências e Tecnologia<br>Quantum Computing is beginning to gather even more attention at a time where efforts are being made into familiarizing younger audiences into not only learning programming on a classical computer, but also on a quantum one.This new paradigm of computation is set to revolutionize several industries as the hardware keeps developing, with the potential to solve problems that a classical computer would consider intangible, as well as giving some specific problems a so sought after speed-up. This i

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!