2661 search results - page 160 / 533 » Quantum Complexity Classes |
122
click to vote
FOCS
1990
IEEE
15 years 7 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
100
click to vote
ALT
2010
Springer
15 years 5 months ago
2010
Springer
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
130
click to vote
WSCG
2001
15 years 4 months ago
2001
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
104
click to vote
JC
2006
15 years 3 months ago
2006
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
129
Voted
TCS
2010
14 years 10 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...