Pages that link to "Item:Q2043884"

From MaRDI portal

← On tseitin formulas, read-once branching programs and treewidth (Q2043884)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to On tseitin formulas, read-once branching programs and treewidth (Q2043884):

Displaying 2 items.

Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q2043884"