|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
Results
Found 26 publication records. Showing 26 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
32 | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 176-184, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Oded Goldreich 0001, Madhu Sudan 0001 |
Locally testable codes and PCPs of almost-linear length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(4), pp. 558-655, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
error-correcting codes, derandomization, probabilistically checkable proofs, Proof verification |
27 | Oded Goldreich 0001, Madhu Sudan 0001 |
Locally Testable Codes and PCPs of Almost-Linear Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 13-22, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Mateja Jamnik, Manfred Kerber, Martin Pollet |
Learn Omega-matic: System Description. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-18, 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002, Proceedings, pp. 150-155, 2002, Springer, 3-540-43931-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Edward A. Hirsch, Sergey I. Nikolenko |
Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 135-142, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah |
Sound 3-Query PCPPs Are Long. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 686-697, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Eli Ben-Sasson, Avi Wigderson |
Short proofs are narrow - resolution made simple. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(2), pp. 149-169, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Mauro Ferrari 0002, Camillo Fiorentini, Guido Fiorino |
On the complexity of the disjunction property in intuitionistic and modal logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(3), pp. 519-538, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
feasible interpolation, proof-length, modal logic, Intuitionistic logic |
18 | Arist Kojevnikov, Alexander S. Kulikov |
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2006, 9th International Conference, Seattle, WA, USA, August 12-15, 2006, Proceedings, pp. 11-21, 2006, Springer, 3-540-37206-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
17 | Uwe Egly |
Quantifers and the System KE: Some Surprising Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 90-104, 1998, Springer, 3-540-65922-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
15 | Jedrzej Potoniec |
Is the Proof Length a Good Indicator of Hardness for Reason-able Embeddings? ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeSy ![In: Proceedings of the 17th International Workshop on Neural-Symbolic Learning and Reasoning, La Certosa di Pontignano, Siena, Italy, July 3-5, 2023., pp. 150-161, 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
15 | Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg |
Shortening of Proof Length is Elusive for Theorem Provers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 30(4), pp. 2050013:1-2050013:14, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Gustavo Lacerda |
Upper-Bounding Proof Length with the Busy Beaver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1406.1808, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Guillaume Burel |
Unbounded Proof-Length Speed-Up in Deduction Modulo. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 496-511, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
rewriting, arithmetic, higher order logic, proof theory |
15 | Allen Van Gelder |
Input Distance and Lower Bounds for Propositional Resolution Proof Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, St. Andrews, UK, June 19-23, 2005, Proceedings, pp. 282-293, 2005, Springer, 3-540-26276-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Gilles Richard, Fatima Zohra Kettaf |
Proof Length as an Uncertainty Factor in ILP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft-Ware ![In: Soft-Ware 2002: Computing in an Imperfect World, First International Conference, Soft-Ware 2002, Belfast, Northern Ireland, April 8-10, 2002, Proceedings, pp. 128-140, 2002, Springer, 3-540-43481-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 66(1), pp. 171-191, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
15 | Uwe Egly |
Non-elementary Speed-ups in Proof Length by Different Variants of Classical Analytic Calculi. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX '97, Pont-à-Mousson, France, May 13-16, 1997, Proceedings, pp. 158-172, 1997, Springer, 3-540-62920-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
15 | Uwe Egly |
Super-Polynomial Speed-Ups in Proof Length by New Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EPIA ![In: Progress in Artificial Intelligence, 7th Portuguese Conference on Artificial Intelligence, EPIA '95, Funchal, Madeira Island, Portugal, October 3-6, 1995, Proceedings, pp. 29-40, 1995, Springer, 3-540-60428-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Matthias Baaz, Christian G. Fermüller, Alexander Leitsch |
A Non-Elementary Speed-Up in Proof Length by Structural Clause Form Transformation ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), Paris, France, July 4-7, 1994, pp. 213-219, 1994, IEEE Computer Society, 0-8186-6310-3. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Thomas Marthedal Rasmussen |
Automated Proof Support for Interval Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings, pp. 320-329, 2001, Springer, 3-540-42957-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
11 | Matthias Baaz, Georg Moser |
On a Generalisation of Herbrand's Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 469-483, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
9 | Jan Johannsen |
An Exponential Lower Bound for Width-Restricted Clause Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings, pp. 128-140, 2009, Springer, 978-3-642-02776-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
9 | Klaus Mayr |
Refinements and Extensions of Model Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning,4th International Conference, LPAR'93, St. Petersburg, Russia, July 13-20, 1993, Proceedings, pp. 217-228, 1993, Springer, 3-540-56944-8. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
8 | Uwe Egly |
On the Value of Antiprenexing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning, 5th International Conference, LPAR'94, Kiev, Ukraine, July 16-22, 1994, Proceedings, pp. 69-83, 1994, Springer, 3-540-58216-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
6 | Adam L. Young, Moti Yung |
A PVSS as Hard as Discrete Log and Shareholder Separability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Public Key Cryptography ![In: Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001, Cheju Island, Korea, February 13-15, 2001, Proceedings, pp. 287-299, 2001, Springer, 3-540-41658-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #26 of 26 (100 per page; Change: )
|
|