Sciweavers

1226 search results - page 150 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 7 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
151
Voted
JCSS
2000
116views more  JCSS 2000»
15 years 3 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
SIGSOFT
2010
ACM
15 years 1 months ago
Software economies
Software construction has typically drawn on engineering metaphors like building bridges or cathedrals, which emphasize architecture, specification, central planning, and determin...
David F. Bacon, Eric Bokelberg, Yiling Chen, Ian A...
122
Voted
ECOOP
2008
Springer
15 years 5 months ago
A Unified Framework for Verification Techniques for Object Invariants
Verification of object-oriented programs relies on object invariants which express consistency criteria of objects. The semantics of object invariants is subtle, mainly because of...
Sophia Drossopoulou, Adrian Francalanza, Peter M&u...
ECCV
2008
Springer
16 years 5 months ago
Finding Actions Using Shape Flows
Abstract. We propose a novel method for action detection based on a new action descriptor called a shape flow that represents both the shape and movement of an object in a holistic...
Hao Jiang, David R. Martin