Difference between revisions of "On the complexity of the parity argument and other inefficient proofs of existence"
From Thermodynamics of Computation
(CSV import Computer Science Theory) |
(CSV import test Logically Reversible Computing 2) |
||
| Line 1: | Line 1: | ||
{{Reference Material | {{Reference Material | ||
| − | |reference groups=Computer Science Theory | + | |reference groups=Computer Science Theory, Logically Reversible Computing |
|Mendeley id=f92ca01f-1b4d-3e01-ac83-477b23e7eaf0 | |Mendeley id=f92ca01f-1b4d-3e01-ac83-477b23e7eaf0 | ||
}} | }} | ||
Latest revision as of 00:24, April 19, 2018
- reference groups
- Computer Science Theory
- Logically Reversible Computing
- author-supplied keywords
- keywords
- authors
- Christos H. Papadimitriou
- title
- On the complexity of the parity argument and other inefficient proofs of existence
- type
- journal
- year
- 1994
- source
- Journal of Computer and System Sciences
- pages
- 498-532
- volume
- 48
- issue
- 3
- link
- https://www.mendeley.com/catalogue/f92ca01f-1b4d-3e01-ac83-477b23e7eaf0/(0)
Counts
- Citation count
- 509
- Page views
- 6
Identifiers
- doi: 10.1016/S0022-0000(05)80063-7 (Google search)
- issn: 10902724
- sgr: 0028459906
- scopus: 2-s2.0-0028459906
- pui: 224183781
