On the complexity of the parity argument and other inefficient proofs of existence
type: Item
instance of: scholarly article
title: On the complexity of the parity argument and other inefficient proofs of existence
zbMATH Open document ID: 0806.68048
DOI: 10.1016/S0022-0000(05)80063-7
published in: Journal of Computer and System Sciences
publication date: 1995-02-13T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 598086
zbMATH Keywords: search problems
zbMATH Keywords: Hamiltonian cubic graph
author: Christos Papadimitriou
MaRDI profile type: Publication
Wikidata QID: Q56138406
cites work: Regular subgraphs of almost regular graphs
cites work: Existence of an Equilibrium for a Competitive Economy
cites work: Q3794177
cites work: Complementary pivot theory of mathematical programming
cites work: Variable Dimension Complexes Part I: Basic Theory
cites work: A constructive proof of Tucker's combinatorial lemma
cites work: Exponential lower bounds for finding Brouwer fixed points
cites work: The Jacobian matrix and global univalence of mappings
cites work: How easy is local search?
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: Equilibrium Points of Bimatrix Games
cites work: Q3221403
cites work: Q3959443
cites work: Every Prime Has a Succinct Certificate
cites work: Q3662618
cites work: Q3481743
cites work: Hamiltonian Cycles and Uniquely Edge Colourable Graphs
cites work: Orientation in Complementary Pivot Algorithms
description: scientific article; zbMATH DE number 598086