612 search results - page 48 / 123 » Hardness assumptions in the foundations of theoretical compu... |
SCCC
2008
IEEE
14 years 2 months ago
2008
IEEE
Many Ambient Intelligence (AmI) scenarios fit perfectly for auto-generated distributed networks, but they assume the existence of good enough network topology organizing the conn...
SOFSEM
2007
Springer
14 years 2 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand t...
RTA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
FOCS
2002
IEEE
14 years 24 days ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...