19320 search results - page 273 / 3864 » On the complexity of computing determinants |
180
click to vote
JASSS
2002
15 years 6 months ago
2002
In a paper published in JASSS, Chris Goldspink discusses the methodological implications of complex systems approaches to the modeling of social systems. Like others before him Go...
152
click to vote
GI
2005
Springer
16 years 5 days ago
2005
Springer
: Rapid evolution of modern Information Systems and Process-Aware Information Systems (PAIS) in particular requires transactional execution of business logic. The paper introduces ...
174
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
168
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
147
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean