Sciweavers

110 search results - page 6 / 22
» Complexity Classes as Mathematical Axioms
Sort
View
92
Voted
EPEW
2006
Springer
15 years 3 months ago
Model Checking for a Class of Performance Properties of Fluid Stochastic Models
Abstract. Recently, there is an explosive development of fluid approaches to computer and distributed systems. These approaches are inherently stochastic and generate continuous st...
Manuela L. Bujorianu, Marius C. Bujorianu
92
Voted
BSL
2006
114views more  BSL 2006»
15 years 5 days ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran
79
Voted
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 6 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
91
Voted
ECCC
2007
90views more  ECCC 2007»
15 years 2 days ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
114
Voted
IS
2007
15 years 22 hour ago
Semantic optimization techniques for preference queries
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are pa...
Jan Chomicki