A feasible interpolation for random resolution
Random resolution, defined by Buss, Kolodziejczyk and Thapen (JSL, 2014), is a sound propositional proof system that extends the resolution proof system by the possibility to augment any set of initial clauses by a set of randomly chosen clauses (modulo a technical condition). We show how to apply t...
Main Author: | Jan Krajicek |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2017-02-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/3120/pdf |
Similar Items
-
A limitation on the KPT interpolation
by: Jan Krajíček
Published: (2020-08-01) -
CONSISTENCY OF CIRCUIT EVALUATION, EXTENDED RESOLUTION AND TOTAL NP SEARCH PROBLEMS
by: JAN KRAJÍČEK
Published: (2016-01-01) -
Unprovability of circuit upper bounds in Cook's theory PV
by: Jan Krajicek, et al.
Published: (2017-02-01) -
Pseudo-finite hard instances for a student-teacher game with a Nisan-Wigderson generator
by: Jan Krajíček
Published: (2012-08-01) -
Width and size of regular resolution proofs
by: Alasdair Urquhart
Published: (2012-06-01)