Feasible Interpolation is a proof-theoretic method in propositional proof complexity that, given a valid implication between two disjoint sets of variables, efficiently constructs an interpolant formula in polynomial time or within a feasible computational bound, distinguishing it from classical interpolation by its emphasis on algorithmic efficiency and applicability to refutation systems.
11
Publications
482
Citations
17
Authors
13
Institutions
Publications per year
2017–2026
0
Parents
Publications
11
Non-Automatizability of Bounded-Depth Frege Proofs
Marı́a Luisa Bonet, Carlos Domingo, Ricard Gavald� et al. · Computational Complexity · 2004 · 71 citations
1–5 of 11
Authors
17
- ML
4
h-index
- TP
4
h-index
- RR
2
h-index
- PH
2
h-index
- JKJan Krajı́ček
Czech Academy of Sciences, Institute of Mathematics, Czechia
2 publications · 85 citations
2
h-index
1–5 of 17
Institutions
13
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
9 publications
390 citations
University of Arizona
Tucson, United States
3 h-index
3 publications
174 citations
Tokyo Institute of Technology
Tokyo, Japan
2 h-index
2 publications
88 citations
Clarkson University
Potsdam, United States
2 h-index
2 publications
88 citations
University of Toronto
Toronto, Canada
2 h-index
2 publications
88 citations
American Committee for the Weizmann Institute of Science
New York, United States
1 h-index
1 publications
20 citations
University of Milano-Bicocca
Milan, Italy
1 h-index
1 publications
11 citations
Danish Meteorological Institute
Copenhagen, Denmark
1 h-index
2 publications
194 citations
1–8 of 13
Venues
- Journal of Symbolic Logic
2 publications · 85 citations
2
h-index
- Electronic colloquium on computational complexity
1 publications · 22 citations
1
h-index
- SIAM Journal on Computing
1 publications · 137 citations
1
h-index
- Computational Complexity
CC · 1 publications · 71 citations
1
h-index
- ACM Transactions on Computational Logic
TOCL · 1 publications · 11 citations
1
h-index
1–5