Sciweavers

2412 search results - page 17 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
SIAMSC
2010
144views more  SIAMSC 2010»
13 years 8 months ago
An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons
In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of parti...
A. H. Barnett, Timo Betcke
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
14 years 2 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
FORMATS
2008
Springer
13 years 11 months ago
Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
Abstract. We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuo...
Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski...
LPNMR
2009
Springer
14 years 4 months ago
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
Jörg Pührer, Hans Tompits
IOLTS
2009
IEEE
174views Hardware» more  IOLTS 2009»
14 years 4 months ago
ATPG-based grading of strong fault-secureness
—Robust circuit design has become a major concern for nanoscale technologies. As a consequence, for design validation, not only the functionality of a circuit has to be considere...
Marc Hunger, Sybille Hellebrand, Alejandro Czutro,...