Sciweavers

4934 search results - page 186 / 987
» complexity 2008
Sort
View
92
Voted
CAS
1999
60views more  CAS 1999»
15 years 4 months ago
Coincidences Are not Accidental: a Theorem
In this paper, we formalize and prove the statement that coincidences cannot be accidental, a statement that underlies many useful heuristics in mathematics and physics. Our proof...
Vladik Kreinovich
136
Voted
SLOGICA
2008
99views more  SLOGICA 2008»
15 years 3 months ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak
JSC
2010
62views more  JSC 2010»
15 years 3 months ago
The invariants of the binary nonic
We consider the algebra of invariants of binary forms of degree 9 with complex coefficients, find the 92 basic invariants, give an explicit system of parameters and show the exis...
Andries E. Brouwer, Mihaela Popoviciu
CN
2008
98views more  CN 2008»
15 years 4 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
CSL
2008
Springer
15 years 6 months ago
Quantitative Game Semantics for Linear Logic
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
Ugo Dal Lago, Olivier Laurent