On the complexity of 2D discrete fixed point problem
type: Item
instance of: scholarly article
title: On the complexity of 2D discrete fixed point problem
zbMATH Open document ID: 1183.68294
author: Xi Chen
author: Xiaotie Deng
published in: Theoretical Computer Science
publication date: 2009-11-04T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5624929
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2009.07.052
OpenAlex ID: W1826384874
cites work: On algorithms for discrete and approximate brouwer fixed points
cites work: The complexity of computing a Nash equilibrium
cites work: Fundamentals of Computation Theory
cites work: Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
cites work: A Sperner lemma complete for PPA
cites work: Exponential lower bounds for finding Brouwer fixed points
cites work: On the complexity of the parity argument and other inefficient proofs of existence
DOI: 10.1016/J.TCS.2009.07.052
description: scientific article; zbMATH DE number 5624929