Work

On the complexity of the parity argument and other inefficient proofs of existence

Year: 1994

Type: article

Source: Journal of Computer and System Sciences

DOI: 10.1016/s0022-0000(05)80063-7

Author: Christos H. Papadimitriou

Institution: University of California San Diego

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: National Science Foundation

OpenAlex ID: W2169359757

FWCI: 5.445

Cites: 34

Cited by: 830

Related to: 9