I agree that this thesis shall be available in accordance with the regulations governing the University of Warwick theses. I agree that the summary of this thesis may be submitted for publication. I agree that the thesis may be photocopied (single copies for study purposes only). Theses with no restriction on photocopying will also be made available to the British Library for microfilming. The British Library may supply copies to individuals or libraries. subject to a statement from them that the copy is supplied for non-publishing purposes. All copies supplied by the British Library will carry the following statement: "Attention is drawn to the fact that the copyright of this thesis rests with its author. This copy of the thesis has been supplied on the condition that anyone who consults it is understood to recognise that its copyright rests with its author and that no quotation from the thesis and no information derived from it may be published without the author's written consent." AUTHOR'S SIGNATURE:................................................ USER'S DECLARATION 1. I undertake not to quote or make use of any information from this thesis without
|
7715
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
5825
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 2001
|
|
2004
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1588
|
Computational Complexity
– Papadimitriou
- 1994
|
|
1289
|
The Probabilistic Method
– Alon, Spencer
- 1992
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1997
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
1154
|
Random graphs
– Bollobás
- 1985
|
|
684
|
Graph Theory
– Harary
- 1971
|
|
503
|
Optimization, approximation, and complexity classes
– Papadimitriou, Yannakakis
- 1991
|
|
372
|
Concrete Mathematics
– Graham, Knuth, et al.
- 1994
|
|
324
|
The complexity of computing the permanent
– Valiant
- 1979
|
|
230
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
224
|
The parallel evaluation of general arithmetic expressions,J
– Brent
- 1974
|
|
213
|
Simulation and the Monte Carlo Method
– Rubinstein
- 1981
|
|
204
|
Random generation of combinatorial structures from a uniform distribution," Theoretical Computer Science 43
– Jerrum, Valiant, et al.
- 1986
|
|
189
|
Efficient randomized pattern-matching algorithms
– Karp, Rabin
- 1987
|
|
188
|
and Endre Szemerédi. Many hard examples for resolution
– Chvátal
- 1988
|
|
183
|
Graphical Enumeration
– Harary, Palmer
- 1973
|
|
166
|
Efficient parallel algorithms
– Gibbons
- 1988
|
|
166
|
A guided tour of Chernoff bounds
– Hagerup, Rub
- 1990
|
|
143
|
Algorithms for random generation and counting: A markov chain approach
– Sinclair
- 1993
|
|
142
|
Probability and Random Processes
– Grimmett, Stirzaker
- 1982
|
|
140
|
An Introduction to Combinatorial Analysis
– Riordan
- 1958
|
|
127
|
gets some (the odds are on his side
– Chvatal, Reed, et al.
- 1992
|
|
120
|
Analysis of two simple heuristics on a random instance of k-SAT
– Frieze, Suen
- 1996
|
|
116
|
On sparse spanners of weighted graphs
– Althöfer, Das, et al.
- 1993
|
|
113
|
Graph spanners
– Peleg, Schäffer
- 1989
|
|
110
|
A random polynomial time algorithm for approximating the volume of convex bodies
– Dyer, Frieze, et al.
- 1989
|
|
99
|
Various techniques used in connection with random digits
– Neumann
- 1951
|
|
95
|
Combinatorial algorithms
– Nijenhuis, Wilf
- 1978
|
|
89
|
A threshold for unsatisfiability
– Goerdt
- 1996
|
|
89
|
A randomized linear-time algorithm for finding minimum spanning trees
– Karger, Klein, et al.
- 1995
|
|
84
|
Algorithms for Minimum Coloring, Maximum Clique, Minimum Coloring by Cliques, and Maximum Independent Set of a Chordal Graph
– Gavril
- 1972
|
|
81
|
An optimal synchronizer for the hypercube
– Peleg, Ullman
- 1987
|
|
77
|
The hardest constraint problems: A double phase transition
– Hogg, Williams
- 1994
|
|
73
|
On Some Tighter Inapproximability Results
– Berman, Karpinski
- 1998
|
|
73
|
Monte-Carlo approximation algorithms for enumeration problems
– Karp, Luby, et al.
- 1989
|
|
70
|
Every monotone graph property has a sharp threshold
– Friedgut, Kalai
- 1996
|
|
66
|
Approximating the unsatisfiability threshold of random formulas. Random Structures Algorithms
– Kirousis, Kranakis, et al.
- 1998
|
|
62
|
T.M.: Mathematical Analysis
– Apostol
- 1974
|
|
60
|
Time bounded random access machines
– Cook, Reckhow
- 1973
|
|
59
|
Trees and flowers
– Edmonds
- 1965
|
|
59
|
On coloring random graphs
– Grimmet, McDiarmid
- 1975
|
|
46
|
Derandomized Graph Products
– Alon, Feige, et al.
- 1995
|
|
42
|
Edge dominating sets in graphs
– Yannakakis, Gavril
- 1980
|
|
40
|
Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem
– Friedgut
- 1999
|
|
35
|
A general upper bound for the satisfiability threshold of random r-SAT formulae
– Dubois, Boufkhad
- 1997
|
|
29
|
On the Existence of a Factor of Degree One of a Connected Random Graph
– Erdös, Rényi
- 1966
|
|
26
|
Almost All Graphs With 1.44n Edges are 3-Colourable
– Chvátal
- 1991
|
|
