SIGACT news complexity theory comun 37

Hemaspaandra, Lane A.

doi:10.1145/582475.582484

Search citation statements

Order By: Relevance

Paper Sections

Select...

The Minimum Tile Set Problem Is σ P 2 -Complete1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2005

2022

Publication Types

Select...

Book5

Article1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 42 publications

(1 citation statement)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To show that MINTILESET is Σ P 2 -hard, we show that ∃∀CNF-UNSAT is polynomial-time many-one reducible to MINTILESET, where ∃∀CNF-UNSAT is the Σ P 2 -complete language [40,45,50] ∃∀CNF-UNSAT =    ϕ ϕ is a true quantified Boolean formula ϕ = ∃x∀y¬φ (x, y), where φ is an unquantified CNF formula with n + m input bits x = x 1 , . .…”

Section: The Minimum Tile Set Problem Is σ P 2 -Completementioning

confidence: 99%