7 results in Forum of Mathematics, Sigma
A generalized Sylvester–Gallai-type theorem for quadratic polynomials
- Part of:
-
- Journal:
- Forum of Mathematics, Sigma / Volume 10 / 2022
- Published online by Cambridge University Press:
- 15 December 2022, e112
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
- Part of:
-
- Journal:
- Forum of Mathematics, Sigma / Volume 10 / 2022
- Published online by Cambridge University Press:
- 07 February 2022, e7
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
Three candidate plurality is stablest for small correlations
- Part of:
-
- Journal:
- Forum of Mathematics, Sigma / Volume 9 / 2021
- Published online by Cambridge University Press:
- 28 September 2021, e65
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
An incompressibility theorem for automatic complexity
- Part of:
-
- Journal:
- Forum of Mathematics, Sigma / Volume 9 / 2021
- Published online by Cambridge University Press:
- 10 September 2021, e62
-
- Article
-
- You have access
- Open access
- HTML
- Export citation
COMPLEXITY OF SHORT GENERATING FUNCTIONS
- Part of:
-
- Journal:
- Forum of Mathematics, Sigma / Volume 6 / 2018
- Published online by Cambridge University Press:
- 14 February 2018, e1
-
- Article
-
- You have access
- Open access
- Export citation
EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Part of:
-
- Journal:
- Forum of Mathematics, Sigma / Volume 5 / 2017
- Published online by Cambridge University Press:
- 02 March 2017, e8
-
- Article
-
- You have access
- Open access
- Export citation
CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS
- Part of:
-
- Journal:
- Forum of Mathematics, Sigma / Volume 4 / 2016
- Published online by Cambridge University Press:
- 24 June 2016, e15
-
- Article
-
- You have access
- Open access
- Export citation