Sciweavers

44 search results - page 3 / 9
» ac 2006
Sort
View
JCSS
1998
74views more  JCSS 1998»
14 years 10 months ago
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
Manindra Agrawal, Eric Allender, Steven Rudich
64
Voted
ACS
2006
14 years 10 months ago
Absolute Lax 2-categories
We have introduced, in a previous paper, the fundamental lax 2-category of a `directed space' X. Here we show that, when X has a T1-topology, this structure can be embedded i...
Marco Grandis
65
Voted
ACS
2006
14 years 10 months ago
Nuclear Typing of Frames vs Spatial Selectors
Nuclei which are defined over a class of frames are called nuclear typings. There is the dual notion of a spatial selector, and the relationship between nuclear typings and spatial...
Jorge Martínez, Eric Richard Zenk
IANDC
2007
126views more  IANDC 2007»
14 years 10 months ago
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryp...
Kumar Neeraj Verma, Jean Goubault-Larrecq
EDBT
2006
ACM
103views Database» more  EDBT 2006»
15 years 10 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...