2661 search results - page 254 / 533 » Quantum Complexity Classes |
148
click to vote
CASCON
2006
15 years 5 months ago
2006
Coupling measures have important applications in software development and maintenance. They are used to reason about the structural complexity of software and have been shown to p...
124
click to vote
CC
2007
Springer
15 years 4 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
151
click to vote
FUIN
2007
15 years 4 months ago
2007
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
143
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
—Several dynamic call admission control (CAC) schemes for cellular networks have been proposed in the literature to reserve resources adaptively to provide the desired quality of...
133
click to vote
WG
1998
Springer
15 years 8 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...