Stem cannot$ (all stems)

18 papers:

FASE-2015-CzechJW #exclamation #verification #what

Just Test What You Cannot Verify! (MC, MCJ, HW), pp. 100–114.

STOC-2015-BackursI #distance #edit distance

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) (AB, PI), pp. 51–58.

DLT-2015-KlimannPS #automaton #infinity

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (IK, MP, DS), pp. 313–325.

HILT-2012-Bosch #library

Synchronization cannot be implemented as a library (GB), pp. 73–80.

LICS-2012-Levin #internet #what

Turing’s Password: What Internet Cannot Leak (LAL), p. 11.

POPL-2011-AttiyaGHKMV #algorithm #concurrent #order

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated (HA, RG, DH, PK, MMM, MTV), pp. 487–498.

KDD-2010-YuHCL #classification #in memory #linear #memory management #scalability

Large linear classification when data cannot fit in memory (HFY, CJH, KWC, CJL), pp. 833–842.

STOC-2008-Gavinsky #interactive #quantum

Classical interaction cannot replace a quantum message (DG), pp. 95–102.

PLDI-2005-Boehm #library #thread

Threads cannot be implemented as a library (HJB), pp. 261–268.

ICALP-2004-BojanczykC #automaton

Tree-Walking Automata Cannot Be Determinized (MB, TC), pp. 246–256.

FoSSaCS-2003-BonevaT

When Ambients Cannot Be Opened (IB, JMT), pp. 169–184.

FoSSaCS-2003-Maier #composition

Compositional Circular Assume-Guarantee Rules Cannot Be Sound and Complete (PM), pp. 343–357.

ICALP-1999-RieckeT #continuation

Typed Exeptions and Continuations Cannot Macro-Express Each Other (JGR, HT), pp. 635–644.

LICS-1999-Ruhl #transitive

Counting and Addition Cannot Express Deterministic Transitive Closure (MR), pp. 326–334.

ICDAR-1997-OgierMLL #analysis #image #reliability #semantics

An Image Interpretation Device cannot be Reliable without any Semantic Coherency Analysis of the Interpretated Objects — Application to French Cadastral Maps (JMO, RM, JL, YL), pp. 532–535.

CADE-1996-HermannK #algorithm #polynomial #unification

Unification Algorithms Cannot be Combined in Polynomial Time (MH, PGK), pp. 246–260.

STOC-1993-JiangL #string

k one-way heads cannot do string-matching (TJ, ML), pp. 62–70.

STOC-1989-PittW #approximate #automaton #consistency #polynomial #problem

The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial (LP, MKW), pp. 421–432.