{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:25:59Z","timestamp":1752229559502},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_58","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"632-645","source":"Crossref","is-referenced-by-count":3,"title":["Phase Transition of Multivariate Polynomial Systems"],"prefix":"10.1007","author":[{"given":"Giordano","family":"Fusco","sequence":"first","affiliation":[]},{"given":"Eric","family":"Bach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-540-39887-5_21","volume-title":"Fast Software Encryption","author":"A. Biryukov","year":"2003","unstructured":"Biryukov, A., De Canni\u00e8re, C.: Block ciphers and systems of quadratic equations. In: Johansson, T. (ed.) FSE 2003. LNCS, vol.\u00a02887, pp. 274\u2013289. Springer, Heidelberg (2003)"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/plms\/s3-73.1.1","volume":"73","author":"P. Beame","year":"1996","unstructured":"Beame, P., et al.: Lower bounds on Hilbert\u2019s Nullstellensatz and propositional proofs. Proc. London Math.\u00a073, 1\u201326 (1996)","journal-title":"Proc. London Math."},{"key":"58_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/BF01294258","volume":"6","author":"S. Buss","year":"1997","unstructured":"Buss, S., et al.: Proof complexity in algebraic systems and bounded depth Frege systems with modular counting. Comput. Complex.\u00a06, 256\u2013298 (1997)","journal-title":"Comput. Complex."},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Clegg, M., Edmonds, J., Impagliazzo, R.: Using the Groebner basis algorithm to find proofs of unsatisfiability. In: Proc. 28th Ann. ACM Symp. Theory Comput., pp. 174\u2013183 (1996)","DOI":"10.1145\/237814.237860"},{"key":"58_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45539-6_27","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"N. Courtois","year":"2000","unstructured":"Courtois, N., et al.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 392\u2013407. Springer, Heidelberg (2000)"},{"key":"58_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-36178-2_17","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"N. Courtois","year":"2002","unstructured":"Courtois, N., Pierpzyk, J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 267\u2013287. Springer, Heidelberg (2002)"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2369602","volume":"21","author":"L.E. Dickson","year":"1899","unstructured":"Dickson, L.E.: Determination of the structure of all linear homogeneous groups in a Galois field which are defined by a quadratic invariant. Amer. J. Math.\u00a021, 193\u2013256 (1899)","journal-title":"Amer. J. Math."},{"key":"58_CR8","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E. Friegut","year":"1999","unstructured":"Friegut, E.: Necessary and sufficient conditions for sharp thresholds of graph properties and the k-SAT problem. Amer. J. Math.\u00a012, 1017\u20131054 (1999)","journal-title":"Amer. J. Math."},{"issue":"1-2","key":"58_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(01)00158-X","volume":"265","author":"J. Franco","year":"2001","unstructured":"Franco, J.: Results related to threshold phenomena research in satisfiability: lower bounds. Theoret. Comput. Sci.\u00a0265(1-2), 147\u2013157 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1-3","key":"58_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.dam.2005.05.008","volume":"153","author":"J. Franco","year":"2005","unstructured":"Franco, J.: Typical case complexity of satisfiability algorithms and the threshold phenomenon. Disc. Appl. Math.\u00a0153(1-3), 89\u2013123 (2005)","journal-title":"Disc. Appl. Math."},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/03081088608817706","volume":"19","author":"F. Gerth III","year":"1986","unstructured":"Gerth III, F.: Limit probabilities for coranks of matrices over GF(q). Lin. Multilin. Alg.\u00a019, 79\u201393 (1986)","journal-title":"Lin. Multilin. Alg."},{"issue":"6","key":"58_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(93)90076-L","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"H\u00e5stad, J., Phillips, S., Safra, S.: A well-characterized approximation problem. Inf. Proc. Lett.\u00a047(6), 301\u2013305 (1993)","journal-title":"Inf. Proc. Lett."},{"issue":"2","key":"58_CR13","first-page":"1093","volume":"17","author":"C. Jordan","year":"1872","unstructured":"Jordan, C.: Sur la forme canonique des congruences du second degr\u00e9 et le nombre de leurs solutions. J. Math. Pures. Appls.\u00a017(2), 1093\u20131095 (1872), Abstract of results in C. R. Acad. Sci. Paris, vol. 74, pp. 1093\u20131095 (1872)","journal-title":"J. Math. Pures. Appls."},{"key":"58_CR14","doi-asserted-by":"crossref","unstructured":"Pitassi, T.: Algebraic propositional proof systems. In: Descriptive Complexity and Finite Models. DIMACS Ser. Discrete Math. Thoret. Comput. Sci., vol.\u00a031, pp. 215\u2013244 (1997)","DOI":"10.1090\/dimacs\/031\/07"},{"key":"58_CR15","doi-asserted-by":"publisher","first-page":"4120","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput.\u00a08, 4120\u20134421 (1979)","journal-title":"SIAM J. Comput."},{"key":"58_CR16","doi-asserted-by":"crossref","unstructured":"Woods, A.R.: Unsatisfiable systems of equations, over a finite field. In: Proc. 39th Ann. Symp. Found. Comput. Sci., pp. 202\u2013211 (1998)","DOI":"10.1109\/SFCS.1998.743444"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:28Z","timestamp":1619516308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_58","relation":{},"subject":[]}}