Sciweavers

1559 search results - page 100 / 312
» Some Group Theory Problems
Sort
View
CSR
2008
Springer
15 years 6 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
MOC
2000
124views more  MOC 2000»
15 years 4 months ago
Local and parallel finite element algorithms based on two-grid discretizations
A number of new local and parallel discretization and adaptive finite element algorithms are proposed and analyzed in this paper for elliptic boundary value problems. These algorit...
Jinchao Xu, Aihui Zhou
LPAR
2007
Springer
15 years 10 months ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
122
Voted
FLAIRS
2003
15 years 5 months ago
Proving Harder Theorems by Axiom Reduction
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
Geoff Sutcliffe, Alexander Dvorský
APCHI
2004
IEEE
15 years 8 months ago
Age Differences in Rendezvousing: 18-30s Vs. 31-45s
One strategy for increasing the usefulness, ease of use and satisfaction of wireless navigation and related services is to tailor a package of services to meet the requirements of ...
Martin Colbert