scientific article; zbMATH DE number 5691440

From MaRDI portal
Publication:5306365

zbMath1206.03051MaRDI QIDQ5306365

No author found.

Publication date: 9 April 2010


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (53)

Hardness Characterisations and Size-width Lower Bounds for QBF ResolutionTotal maps of Turing categoriesReverse complexitySuperpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problemsExpander Construction in VNC1Unnamed ItemUnnamed ItemCharacterizing Propositional Proofs as Noncommutative FormulasSTRICT FINITISM, FEASIBILITY, AND THE SORITESCorrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplicationExpander construction in \(\mathrm{VNC}^1\)Primitive recursive reverse mathematicsUnnamed ItemReal closures of models of weak arithmeticModels of VTC0$\mathsf {VTC^0}$ as exponential integer partsCharacteristic set algorithms for equation solving in finite fieldsA game characterisation of tree-like Q-resolution sizeOn the finite axiomatizability ofObservations on complete sets between linear time and polynomial timeA note on SAT algorithms and proof complexityOn theories of bounded arithmetic for \(\mathrm{NC}^1\)The provably total NP search problems of weak second order bounded arithmeticThe strength of extensionality. II: Weak weak set theories without infinityBuild your own clarithmetic I: Setup and completenessElementary analytic functions in \(\mathsf{VT}\mathsf{C}^0\)From QBFs to \textsf{MALL} and back via focussingOn the efficiency of solving Boolean polynomial systems with the characteristic set methodCircuit lower bounds in bounded arithmeticsAchieving New Upper Bounds for the Hypergraph Duality Problem through LogicLower bound techniques for QBF expansionA form of feasible interpolation for constant depth Frege systemsRoot finding with threshold circuitsConservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\)Partially definable forcing and bounded arithmeticFeasibly constructive proofs of succinct weak circuit lower boundsThe treewidth of proofsIndependence results for variants of sharply bounded inductionSimulation of Natural Deduction and Gentzen Sequent CalculusUnnamed ItemUnderstanding cutting planes for QBFsBuilding strategies into QBF proofsA Game Characterisation of Tree-like Q-resolution SizeRethinking Defeasible Reasoning: A Scalable ApproachShort propositional refutations for dense random 3CNF formulasA formal framework for stringologyA recursion-theoretic characterisation of the positive polynomial-time functionsInduction rules in bounded arithmeticUnnamed ItemUnnamed ItemUnnamed ItemOpen induction in a bounded arithmetic for \(\mathrm{TC}^{0}\)Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial RepresentationsApplicative theories for logarithmic complexity classes




This page was built for publication: