5608 search results - page 268 / 1122 » On the Theory of Matchgate Computations |
164
click to vote
FOCS
2006
IEEE
16 years 22 days ago
2006
IEEE
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness...
173
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
275
click to vote
Lab
Our research is motivated by a strong conviction that business processes in electronic enterprises can be designed to deliver high levels of performance through the use of mathemat...
154
click to vote
FCT
2007
Springer
16 years 25 days ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
165
click to vote
FOSSACS
2007
Springer
16 years 25 days ago
2007
Springer
We use the framework of biorthogonality to introduce a novel semantic definition of the concept of barb (basic observable) for process calculi. We develop a uniform basic theory o...