1199 search results - page 92 / 240 » Parameterized Proof Complexity |
110
Voted
ICALP
2007
Springer
15 years 7 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
92
Voted
COCO
1995
Springer
15 years 4 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
97
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
104
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
110
Voted
FUIN
2008
15 years 25 days ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...