Phase transition of multivariate polynomial systems
From MaRDI portal
Publication:3616213
DOI10.1017/S0960129508007251zbMATH Open1170.68017MaRDI QIDQ3616213FDOQ3616213
Publication date: 24 March 2009
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Stochastic processes (60G99)
Cites Work
- The Complexity of Enumeration and Reliability Problems
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- A well-characterized approximation problem
- Sharp thresholds of graph properties, and the $k$-sat problem
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
- Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs
- Results related to threshold phenomena research in satisfiability: Lower bounds
- Limit probabilities for coranks of matrices over GF(q)
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
Cited In (3)
This page was built for publication: Phase transition of multivariate polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3616213)