- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Nisan-Wigderson generators in proof systems with forms of interpolation
Mathematical Logic Quarterly 57 (4):379-383 (2011)
Abstract
We prove that the Nisan-Wigderson generators based on computationally hard functions and suitable matrices are hard for propositional proof systems that admit feasible interpolation. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, WeinheimOther Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Notes on Craig interpolation for LJ with strong negation.Norihiro Kamide - 2011 - Mathematical Logic Quarterly 57 (4):395-399.
Simulating non-prenex cuts in quantified propositional calculus.Emil Jeřábek & Phuong Nguyen - 2011 - Mathematical Logic Quarterly 57 (5):524-532.
On the proof complexity of the nisan–wigderson generator based on a hard np ∩ conp function.Jan Krajíček - 2011 - Journal of Mathematical Logic 11 (1):11-27.
Spatiality and classical logic.Milena Stefanova & Silvio Valentini - 2011 - Mathematical Logic Quarterly 57 (4):432-440.
Interpolation and Approximate Semantic Derivations.Jan Krajíček - 2002 - Mathematical Logic Quarterly 48 (4):602-606.
Ordinal arithmetic with simultaneously defined theta‐functions.Andreas Weiermann & Gunnar Wilken - 2011 - Mathematical Logic Quarterly 57 (2):116-132.
Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.
Powers of positive elements in C *-algebras.Hiroki Takamura - 2011 - Mathematical Logic Quarterly 57 (5):481-484.
Biprobability logic with conditional expectation.Vladimir Ristić, Radosav Đorđević & Nebojša Ikodinović - 2011 - Mathematical Logic Quarterly 57 (4):400-408.
On the Existence of Strong Proof Complexity Generators.Jan Krajíček - 2024 - Bulletin of Symbolic Logic 30 (1):20-40.
Analytics
Added to PP
2013-12-01
Downloads
23 (#936,487)
6 months
4 (#1,246,434)
2013-12-01
Downloads
23 (#936,487)
6 months
4 (#1,246,434)
Historical graph of downloads
Citations of this work
On the proof complexity of the nisan–wigderson generator based on a hard np ∩ conp function.Jan Krajíček - 2011 - Journal of Mathematical Logic 11 (1):11-27.
References found in this work
Interpolation theorems, lower Bounds for proof systems, and independence results for bounded arithmetic.Jan Krajíček - 1997 - Journal of Symbolic Logic 62 (2):457-486.
Lower Bounds for resolution and cutting plane proofs and monotone computations.Pavel Pudlak - 1997 - Journal of Symbolic Logic 62 (3):981-998.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lv8mh dc2