<--- Back to Details
First PageDocument Content
Graph coloring / NP-complete problems / Semidefinite programming / Clique / Lovász number / Edge coloring / Graph / Clique problem / Graph theory / Mathematics / Theoretical computer science
Date: 2007-01-26 05:46:17
Graph coloring
NP-complete problems
Semidefinite programming
Clique
Lovász number
Edge coloring
Graph
Clique problem
Graph theory
Mathematics
Theoretical computer science

MSc projects at BT Research Keith Briggs keithbriggs.info

Add to Reading List

Source URL: keithbriggs.info

Download Document from Source Website

File Size: 241,63 KB

Share Document on Facebook

Similar Documents

Mathematics / OSI protocols / Computational number theory / Lattice points / Algebra / Orthogonal frequency-division multiplexing / MIMO / Cyclic prefix / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Radio resource management / Information theory / IEEE 802

Lattice-Reduction-Aided Receivers for MIMO-OFDM in Spatial Multiplexing Systems Inaki Berenguer1 , Jaime Adeane1 , Ian J. Wassell1 , and Xiaodong Wang2 1 Laboratory for Communication Engineering Department of Engineering

DocID: 195pA - View Document

Metalogic / Model theory / Symbol / Peano axioms / Constructible universe / Lovász number / Logic / Mathematical logic / Mathematics

Logic and the Methodology of Science June 2004 Preliminary Exam August 23, a) Outline a proof that the theory of rings is not decidable. (b) Show that the set V of all valid formulae in the language of rings is

DocID: 18sUJ - View Document

Lattice points / Cryptography / Computational number theory / Linear algebra / Quadratic forms / Lattice problem / Lattice reduction / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Algebra / Mathematics / Abstract algebra

A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors ? ?? Dan Ding1 , Guizhen Zhu2 , Yang Yu1 , Zhongxiang Zheng1 1 Department of Computer Science and Tech

DocID: 12Qnp - View Document

Cryptography / Lattice points / Linear algebra / Computational number theory / Lattice problem / Lattice / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Vector space / Algebra / Mathematics / Abstract algebra

Solving the Shortest Lattice Vector Problem in Time 22.465n Xavier Pujol1 and Damien Stehl´e2 1 Universit´e de Lyon, Laboratoire LIP, CNRS-ENSL-INRIA-UCBL, 46 All´ee d’Italie, 69364 Lyon Cedex 07, France 2

DocID: 12PSf - View Document

Cryptography / Lattice points / Computational number theory / Linear algebra / Lattice problem / Lattice / Normal distribution / Lenstra–Lenstra–Lovász lattice basis reduction algorithm / Vector space / Mathematics / Algebra / Abstract algebra

Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem ? Xiaoyun Wang1,2 , Mingjie Liu1 , Chengliang Tian2 and Jingguo Bi2 1 Institute for Advanced Study, Tsinghua University, Beijing, China

DocID: 12JYy - View Document