Sciweavers

1236 search results - page 2 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
SIGCSE
2002
ACM
88views Education» more  SIGCSE 2002»
13 years 7 months ago
Teaching computer organization/architecture with limited resources using simulators
As the complexity and variety of computer system hardware increases, its suitability as a pedagogical tool in computer organization/architecture courses diminishes. As a consequen...
Gregory S. Wolffe, William Yurcik, Hugh Osborne, M...
VLDB
2003
ACM
141views Database» more  VLDB 2003»
14 years 7 months ago
Computing complete answers to queries in the presence of limited access patterns
In data applications such as information integration, there can be limited access patterns to relations, i.e., binding patterns require values to be specified for certain attribut...
Chen Li
COCO
1998
Springer
109views Algorithms» more  COCO 1998»
13 years 11 months ago
Complexity Limitations on Quantum Computation
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
Lance Fortnow, John D. Rogers
ICALP
2009
Springer
14 years 7 months ago
Limiting Negations in Formulas
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...
Hiroki Morizumi