Sciweavers

9842 search results - page 205 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EKNOW
2009
13 years 8 months ago
Visual Middle-Out Modeling of Problem Spaces
Modeling is a complex and central activity in many domains. Domain experts and designers usually work by drawing and create models from the middle-out; however, visual and middle-...
Andrea Valente
ICASSP
2011
IEEE
13 years 2 months ago
Secure video processing: Problems and challenges
Secure signal processing is an emerging technology to enable signal processing tasks in a secure and privacy-preserving fashion. It has attracted a great amount of research attent...
Wenjun Lu, Avinash L. Varna, Min Wu
JCSS
2008
120views more  JCSS 2008»
13 years 10 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
SAT
2004
Springer
99views Hardware» more  SAT 2004»
14 years 4 months ago
Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
Carlos Ansótegui, Felip Manyà
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 10 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak