„natural proofs“

Suchergebnisse

1.000+ Treffer

• Applied Logic for Computer Scientists – Computational Deduction and Formal Proofs
  Ayala-Rincón, Mauricio ; Moura, Flávio L. C. ˜deœ 2017 Springer International Publishing
• Foundations for natural proofs and quantifier instantiation
  Löding, Christof ; Madhusudan, P. ; Peña, Lucas 2018 Universitätsbibliothek der RWTH Aachen
• Transformation of Refutation Graphs into Natural Deduction Proofs
  Lingenfelder, Christoph 2023 Saarländische Universitäts- und Landesbibliothek
• Proofs and Illustrations of the Attributes of God: From the Facts and Laws of the Physical Universe: Being the Foundation of Natural and Revealed Religion – Vol. 3
  Macculloch, John 2024 Outlook Verlag
• Proofs and Illustrations of the Attributes of God: From the Facts and Laws of the Physical Universe: Being the Foundation of Natural and Revealed Religion – Vol. 1
  Macculloch, John 2024 Outlook Verlag
• Proofs and Illustrations of the Attributes of God: From the Facts and Laws of the Physical Universe: Being the Foundation of Natural and Revealed Religion – Vol. 2
  Macculloch, John 2024 Outlook Verlag
• Autograding Mathematical Induction Proofs with Natural Language Processing
  Zhao, Chenyan ; Silva, Mariana ; Poulsen, Seth
• Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
  Tzameret, Iddo ; Zhang, Lu-Ming 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Distributional PAC-Learning from Nisan’s Natural Proofs
  Karchmer, Ari 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Black-Box Constructive Proofs Are Unavoidable
  Chen, Lijie ; Williams, Ryan ; Yang, Tianqi 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• If VNP Is Hard, Then so Are Equations for It
  Kumar, Mrinal ; Ramya, C. ; Saptharishi, Ramprasad ; Tengse, Anamay 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Proof Complexity of Natural Formulas via Communication Arguments
  Itsykson, Dmitry ; Riazanov, Artur 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Beyond Natural Proofs: Hardness Magnification and Locality
  Chen, Lijie ; Hirahara, Shuichi ; Oliveira, Igor C. ; Pich, Ján ; Rajgopal, Ninad ; Santhanam, Rahul 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Pseudorandomness and the Minimum Circuit Size Problem
  Santhanam, Rahul 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Expander-Based Cryptography Meets Natural Proofs
  Carboni Oliveira, Igor ; Santhanam, Rahul ; Tell, Roei 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Small Bias Requires Large Formulas
  Bogdanov, Andrej 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Agnostic Learning from Tolerant Natural Proofs
  Carmosino, Marco L. ; Impagliazzo, Russell ; Kabanets, Valentine ; Kolokolova, Antonina 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Learning Algorithms from Natural Proofs
  Carmosino, Marco L. ; Impagliazzo, Russell ; Kabanets, Valentine ; Kolokolova, Antonina 2016 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures
  Parthasarathy, Madhusudan 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Propositions in Prepositional Logic Provable Only by Indirect Proofs
  Ekman, Jan