The Direct Argument for Incompatibilism
- 作者Stump, Eleonore; Fischer, John Martin; Ravizza, Mark
- 卷第61卷
- 期第2期
- 文件大小183.93KB
- 发表时间2000
- DOI10.2307/2653663
- 页码459-466
An editorialJoachim von zur Gathen · Computational Complexity · 1991
Instructions for preparing camera-ready manuscriptsComputational Complexity · 1991
Decompositions of algebras over ℝ and ℂWayne Eberly · Computational Complexity · 1991
Improving known solutions is hardDesh Ranjan; Suresh Chari; Pankaj Rohatgi · Computational Complexity · 1993
Parallel pointer machinesStephen A. Cook; Patrick W. Dymond · Computational Complexity · 1993
A deterministic test for permutation polynomialsI. E. Shparlinski · Computational Complexity · 1992
Counting curves and their projectionsJoachim von zur Gathen; Marek Karpinski; Igor Shparlinski · Computational Complexity · 1996-1997
The hardness of approximation: Gap locationErez Petrank · Computational Complexity · 1994