20 results
Asymptotic Structure of Graphs with the Minimum Number of Triangles
- Part of
-
- Journal:
- Combinatorics, Probability and Computing / Volume 26 / Issue 1 / January 2017
- Published online by Cambridge University Press:
- 04 May 2016, pp. 138-160
-
- Article
-
- You have access
- Open access
- Export citation
Non-Three-Colourable Common Graphs Exist
-
- Journal:
- Combinatorics, Probability and Computing / Volume 21 / Issue 5 / September 2012
- Published online by Cambridge University Press:
- 16 March 2012, pp. 734-742
-
- Article
- Export citation
Constructing Small Sets that are Uniform in Arithmetic Progressions
-
- Journal:
- Combinatorics, Probability and Computing / Volume 2 / Issue 4 / December 1993
- Published online by Cambridge University Press:
- 12 September 2008, pp. 513-518
-
- Article
- Export citation
On the Minimal Density of Triangles in Graphs
-
- Journal:
- Combinatorics, Probability and Computing / Volume 17 / Issue 4 / July 2008
- Published online by Cambridge University Press:
- 01 July 2008, pp. 603-618
-
- Article
- Export citation
Flag algebras
-
- Journal:
- The Journal of Symbolic Logic / Volume 72 / Issue 4 / December 2007
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1239-1282
- Print publication:
- December 2007
-
- Article
- Export citation
Foundations of computational complexity theory
-
-
- Book:
- Surveys in Modern Mathematics
- Published online:
- 18 December 2009
- Print publication:
- 14 April 2005, pp 186-202
-
- Chapter
- Export citation
ARTICLES
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp 209-210
-
- Chapter
- Export citation
Participant photographs
- from PHOTOGRAPHS
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp 199-206
-
- Chapter
- Export citation
Introduction
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp v-viii
-
- Chapter
- Export citation
Contents
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp ix-x
-
- Chapter
- Export citation
TUTORIALS
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp 1-2
-
- Chapter
- Export citation
Logic Colloquium 2000
-
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005
Frontmatter
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp i-iv
-
- Chapter
- Export citation
Maurice Boffa (1939–2001)
- from PHOTOGRAPHS
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp 207-208
-
- Chapter
- Export citation
PHOTOGRAPHS
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp -
-
- Chapter
- Export citation
K. Jon Barwise (1942-2000)
-
- Book:
- Logic Colloquium 2000
- Published online:
- 27 June 2017
- Print publication:
- 02 March 2005, pp xi-xii
-
- Chapter
- Export citation
Michael Alekhnovich, Sam Buss, Shlomo Moran, and Toniann Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. The journal of symbolic logic, vol. 66 (2001), pp. 171–191.
-
- Journal:
- Bulletin of Symbolic Logic / Volume 8 / Issue 2 / June 2002
- Published online by Cambridge University Press:
- 15 January 2014, pp. 301-302
- Print publication:
- June 2002
-
- Article
- Export citation
Proof complexity and feasible arithmetics, DIMACS workshop, April 21–24, 1996, edited by Paul W. Beame and Samuel R. Buss, Series in discrete mathematics and theoretical computer science, vol. 39, American Mathematical Society, Providence1998, xii + 320 pp.
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 4 / December 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1823-1825
- Print publication:
- December 1999
-
- Article
- Export citation
On systems of equations in free groups
-
-
- Book:
- Combinatorial and Geometric Group Theory, Edinburgh 1993
- Published online:
- 05 April 2013
- Print publication:
- 03 November 1994, pp 269-283
-
- Chapter
- Export citation
On Submodular Complexity Measures
-
-
- Book:
- Boolean Function Complexity
- Published online:
- 23 September 2009
- Print publication:
- 05 November 1992, pp 76-83
-
- Chapter
- Export citation