Login / Signup
Polynomial Identity Testing and the Ideal Proof System: PIT is in NP if and only if IPS can be p-simulated by a Cook-Reckhow proof system.
Joshua A. Grochow
Published in:
CoRR (2023)
Keyphrases
</>
modal logic
computational complexity
np complete
clause learning
intuitionistic logic
linear time temporal logic
real time
neural network
information systems
face recognition
optimal solution
np hard
software testing
identity management
sequent calculus