Pages that link to "Item:Q5354392"
From MaRDI portal
The following pages link to Determining computational complexity from characteristic ‘phase transitions’ (Q5354392):
Displaying 8 items.
- A physicist's approach to number partitioning (Q5958802) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Lower bounds for random 3-SAT via differential equations (Q5958806) (← links)
- Upper bounds on the satisfiability threshold (Q5958807) (← links)
- Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs (Q5958808) (← links)
- Frozen development in graph coloring (Q5958809) (← links)
- Satisfiability threshold for random regular \textsc{nae-sat} (Q5963757) (← links)
- Complexity of Stability. (Q6065416) (← links)