Phase transition of multivariate polynomial systems

DOI10.1017/S0960129508007251zbMath1170.68017MaRDI QIDQ3616213

Giordano Fusco, Eric Bach

Publication date: 24 March 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Stochastic processes (60G99)

Related Items (1)

Functional graphs of polynomials over finite fields

Cites Work

• A well-characterized approximation problem
• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
• Typical case complexity of satisfiability algorithms and the threshold phenomenon
• Limit probabilities for coranks of matrices over GF(q)
• The Complexity of Enumeration and Reliability Problems
• Sharp thresholds of graph properties, and the $k$-sat problem
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
• Results related to threshold phenomena research in satisfiability: Lower bounds

This page was built for publication: Phase transition of multivariate polynomial systems