Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • the polytime functions 1993-04-01 Paper Approximation and Small-Depth Frege Proofs 1993-03-09 Paper Parallel random access machines with bounded memory...
    10 bytes (18 words) - 16:49, 12 December 2023
  • Instances 2019-10-11 Paper Short proofs of the Kneser-Lovász coloring principle 2018-06-14 Paper QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE...
    10 bytes (19 words) - 14:26, 11 December 2023
  • nonstationary model 2013-01-07 Paper Non-automatizability of bounded-depth Frege proofs 2005-02-23 Paper Adaptive sampling methods for scaling up knowledge discovery...
    10 bytes (16 words) - 10:40, 13 December 2023
  • 2017-09-27 Paper Uniform proofs of ACC representations 2017-09-15 Paper The NP Search Problems of Frege and Extended Frege Proofs 2017-07-13 Paper Resource-bounded...
    10 bytes (19 words) - 14:53, 7 December 2023
  • Paper The complexity of analytic tableaux 2015-02-27 Paper Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets 2009-01-13 Paper The complexity...
    10 bytes (19 words) - 17:15, 12 December 2023
  • mardi4nfdi.de/entity/Q5136303 2020-11-25 Paper Characterising tree-like Frege proofs for QBF 2019-09-17 Paper https://portal.mardi4nfdi.de/entity/Q4625702...
    10 bytes (16 words) - 09:42, 6 October 2023
  • complete 2019-11-29 Paper Short proofs of the Kneser-Lovász coloring principle 2018-06-14 Paper QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE...
    10 bytes (17 words) - 19:57, 24 September 2023
  • Publication Date of Publication Type Polynomal-size Frege proofs of Bollobás' theorem on the trace of sets 2009-01-13 Paper The optimality of a certain...
    10 bytes (17 words) - 11:49, 12 December 2023
  • Publication Type A new proof of the weak pigeonhole principle 2014-09-26 Paper Non-automatizability of bounded-depth Frege proofs 2005-02-23 Paper Efficient...
    10 bytes (16 words) - 12:49, 7 October 2023
  • https://portal.mardi4nfdi.de/entity/Q4850548 1996-06-06 Paper Cutting plane and Frege proofs 1996-04-16 Paper https://portal.mardi4nfdi.de/entity/Q3140635 1994-08-21...
    10 bytes (18 words) - 23:46, 11 December 2023
  • Computational Paradigms 2006-01-11 Paper Non-automatizability of bounded-depth Frege proofs 2005-02-23 Paper https://portal.mardi4nfdi.de/entity/Q4739610 2004-08-06...
    10 bytes (17 words) - 02:35, 12 December 2023
  • 1997-10-06 Paper An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle 1995-11-05 Paper Maximal Subgroups of Infinite...
    10 bytes (18 words) - 12:49, 7 October 2023
  • Logic of subtyping 2006-08-16 Paper Upper bounds on complexity of Frege proofs with limited use of certain schemata 2006-05-26 Paper On modal logics of...
    10 bytes (18 words) - 23:49, 10 December 2023
  • bounded depth frege proofs of the pigeonhole principle 1995-11-05 Paper Lower bounds to the size of constant-depth propositional proofs 1994-11-03 Paper...
    10 bytes (17 words) - 12:15, 9 December 2023
  • improved witnessing 2017-12-20 Paper The NP Search Problems of Frege and Extended Frege Proofs 2017-07-13 Paper Cobham recursive set functions 2016-01-12 Paper...
    10 bytes (17 words) - 08:53, 7 October 2023
  • 2013-04-18 Paper Width and size of regular resolution proofs 2012-06-01 Paper The depth of resolution proofs 2011-11-23 Paper https://portal.mardi4nfdi.de/entity/Q3002781...
    10 bytes (17 words) - 09:59, 6 October 2023
  • 2005-07-05 Paper Non-automatizability of bounded-depth Frege proofs 2005-02-23 Paper Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles 2005-02-21...
    10 bytes (17 words) - 22:41, 24 September 2023
  • recent strong inapproximability results 2022-12-09 Paper On Small-depth Frege Proofs for Tseitin for Grids 2022-12-08 Paper Explicit Two-Deletion Codes With...
    10 bytes (19 words) - 23:46, 8 December 2023
  • Publication Date of Publication Type A parity-based Frege proof for the symmetric pigeonhole principle 1994-03-22 Paper...
    10 bytes (16 words) - 15:22, 24 September 2023
  • 3-Query PCPPs Are Long 2015-09-24 Paper Lower bounds for bounded depth Frege proofs via Pudlák-Buss games 2015-09-17 Paper Polynomially Low Error PCPs with...
    10 bytes (16 words) - 10:00, 25 September 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)