199 search results - page 16 / 40 » Computationally and Algebraically Complex Finite Algebra Mem... |
SIAMDM
2010
13 years 3 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
ACCV
2009
Springer
14 years 1 months ago
2009
Springer
Algebraic invariants extracted from coefficients of implicit polynomials (IPs) have been attractive because of its convenience for solving the recognition problem in computer visio...
SIAMDM
2010
13 years 7 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
CADE
2007
Springer
14 years 9 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...