Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Van Rooij, Iris
2008.
The Tractable Cognition Thesis.
Cognitive Science,
Vol. 32,
Issue. 6,
p.
939.
Arora, Sanjeev
Steurer, David
and
Wigderson, Avi
2009.
Automata, Languages and Programming.
Vol. 5555,
Issue. ,
p.
119.
Krishnamurthy, Nagarajan
Parthasarathy, T.
and
Ravindran, G.
2009.
Communication complexity of stochastic games.
p.
411.
Bienvenu, Laurent
Day, Adam R.
and
Hölzl, Rupert
2009.
From Bi-Immunity to Absolute Undecidability.
The Journal of Symbolic Logic,
Vol. 78,
Issue. 4,
p.
1218.
Hansen, Kristoffer Arnsfelt
and
Koucký, Michal
2009.
A New Characterization of ACC^0 and Probabilistic CC^0.
p.
27.
Xiao, David
2009.
On Basing ZK ≠ BPP on the Hardness of PAC Learning.
p.
304.
Mie, Thilo
2009.
Short PCPPs verifiable in polylogarithmic time with O(1) queries.
Annals of Mathematics and Artificial Intelligence,
Vol. 56,
Issue. 3-4,
p.
313.
Sarrafzadeh, A.
Shanbehzadeh, J.
Dadgostar, F.
Fan, C.
and
Alexander, S.
2009.
Assisting the autistic with real-time facial expression recognition.
p.
90.
Impagliazzo, Russell
Kabanets, Valentine
and
Kolokolova, Antonina
2009.
An axiomatic approach to algebrization.
p.
695.
Kozhevnikov, A. A.
and
Nikolenko, S. I.
2009.
On complete one-way functions.
Problems of Information Transmission,
Vol. 45,
Issue. 2,
p.
168.
Buchin, Kevin
and
Mulzer, Wolfgang
2009.
Delaunay Triangulations in O(sort(n)) Time and More.
p.
139.
Allender, Eric
Arvind, V.
and
Wang, Fengming
2010.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 6302,
Issue. ,
p.
380.
Ruspini, Enrique H.
2010.
Soft Computing: Coping with Complexity.
International Journal of Computational Intelligence Systems,
Vol. 3,
Issue. 2,
p.
190.
Allender, Eric
2010.
Programs, Proofs, Processes.
Vol. 6158,
Issue. ,
p.
1.
Krajíček, Jan
2010.
Computer Science Logic.
Vol. 6247,
Issue. ,
p.
22.
MIROWSKI, PHILIP
2010.
Inherent Vice: Minsky, Markomata, and the tendency of markets to undermine themselves.
Journal of Institutional Economics,
Vol. 6,
Issue. 4,
p.
415.
Chitambar, Eric
Duan, Runyao
and
Shi, Yaoyun
2010.
Multipartite-to-bipartite entanglement transformations and polynomial identity testing.
Physical Review A,
Vol. 81,
Issue. 5,
Jozsa, Richard
Kraus, Barbara
Miyake, Akimasa
and
Watrous, John
2010.
Matchgate and space-bounded quantum computations are equivalent.
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences,
Vol. 466,
Issue. 2115,
p.
809.
Hetland, Magnus Lie
2010.
Python Algorithms: Mastering Basic Algorithms in the Python Language.
p.
241.
Lovett, Shachar
Mukhopadhyay, Partha
and
Shpilka, Amir
2010.
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields.
p.
695.