Sciweavers

58 search results - page 10 / 12
» Probabilistic Proof Systems: A Primer
Sort
View
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
IEEESCC
2006
IEEE
14 years 1 months ago
Ontology Reconciliation for Service-Oriented Computing
Service-oriented computing (SOC) is viewed as the computing paradigm of the near future, allowing for the dynamic interaction of services provided by distributed business partners...
Jingshan Huang, Jiangbo Dang, Michael N. Huhns
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
13 years 11 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
SIAMDM
2008
97views more  SIAMDM 2008»
13 years 7 months ago
Disjoint Color-Avoiding Triangles
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
Raphael Yuster
GEOS
2009
Springer
14 years 5 days ago
Towards Reasoning Pragmatics
Abstract. The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenge...
Pascal Hitzler