scientific article; zbMATH DE number 1263206
From MaRDI portal
zbMath0978.68526MaRDI QIDQ4234077
Russell Impagliazzo, Toniann Pitassi, Jeff Edmonds, P. W. Beame, Stephen A. Cook
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
TFNP: An Update, Cutting planes, connectivity, and threshold logic, A tight relationship between generic oracles and type-2 complexity theory, Proof complexity in algebraic systems and bounded depth Frege systems with modular counting, An exponential separation between the parity principle and the pigeonhole principle, Inverting onto functions., Can PPAD hardness be based on standard cryptographic assumptions?, Propositional proof complexity, Good degree bounds on Nullstellensatz refutations of the induction principle, Tractability of cut-free Gentzen-type propositional calculus with permutation inference. II, Some graphic uses of an even number of odd nodes, The complexity of finding a second Hamiltonian cycle in cubic graphs
