269 search results - page 3 / 54 » Complexity Theory Made Easy |
BROADNETS
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— Limited resources and time-varying nature of wireless ad hoc networks demand optimized use of resources across layers. Cross-layer optimization (CLO) for wireless netwo...
EDBT
1990
ACM
13 years 9 months ago
1990
ACM
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
JC
2008
13 years 5 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...