Pages that link to "Item:Q6108442"

The following pages link to Reluplex: a calculus for reasoning about deep neural networks (Q6108442):

Displaying 2 items.

• Reachability is NP-complete even for the simplest neural networks (Q2695495) (← links)
• Reachability in Simple Neural Networks (Q6070612) (← links)