Result 1 to 20 of 258 total
Tight bounds on the threshold for permuted $k$-colorability. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 505-516 (2012).
1
The successor representation and temporal context. (English)
Neural Comput. 24, No. 6, 1553-1568 (2012).
2
Approximating the permanent via nonabelian determinants. (English)
SIAM J. Comput. 41, No. 2, 332-355 (2012).
3
A graph integral formulation of the circuit partition polynomial. (English)
Comb. Probab. Comput. 20, No. 6, 911-920 (2011).
4
The nature of computation. (English)
Oxford: Oxford University Press (ISBN 978-0-19-923321-2/hbk). xvii, 985~p. \sterling~55.00 (2011).
5
Independent sets in random graphs from the weighted second moment method. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 472-482 (2011).
6
McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks. (English)
Rogaway, Phillip (ed.), Advances in cryptology ‒ CRYPTO 2011. 31st annual cryptology conference, Santa Barbara, CA, USA, August 14‒18, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22791-2/pbk). Lecture Notes in Computer Science 6841, 761-779 (2011).
7
Construction of Bayer’s theorem in the sample space $S^p_{N,r} (S^c_{N,r})$ of $r$-permutations/$r$-combinations. (English)
Far East J. Appl. Math. 52, No. 1, 27-36 (2011).
8
Parallel complexity of random Boolean circuits. (English)
Comput. Res. Repos. 2011, Article No. 1102.3310 (2011).
9
Phase transition in the detection of modules in sparse networks. (English)
Comput. Res. Repos. 2011, Article No. 1102.1182 (2011).
10
A graph integral formulation of the circuit partition polynomial (English)
Combinatorics, Probability & Computing 20, No. 6, 911-920 (2011).
11
The rigidity transition in random graphs (English)
SODA, 1237-1252 (2011).
12
McEliece and niederreiter cryptosystems that resist quantum Fourier sampling attacks (English)
CRYPTO, 761-779 (2011).
13
Independent sets in random graphs from the weighted second moment method (English)
APPROX-RANDOM, 472-482 (2011).
14
Investigating the suitability of a software capture trigger in a 3D reconstruction system for telepresence (English)
DS-RT, 134-137 (2011).
15
Active learning for node classification in assortative and disassortative networks (English)
KDD, 841-849 (2011).
16
Finding conjugate stabilizer subgroups in PSL$(2;q)$ and related groups. (English)
Quantum Inf. Comput. 10, No. 3-4, 282-291 (2010).
17
Limitations of quantum coset states for graph isomorphism. (English)
J. ACM 57, No. 6, 34 (2010).
18
Sharing music files: tactics of a challenge to the industry. (English)
First Monday 15, No. 12 (2010).
19
On the impossibility of a quantum sieve algorithm for graph isomorphism. (English)
SIAM J. Comput. 39, No. 6, 2377-2396 (2010).
20
Result 1 to 20 of 258 total
Start
Contact
Print
General Help
