Results 21 to 30 of about 7,737 (109)

Anticipation as prediction in the predication of data types [PDF]

open access: yes, 2009
Every object in existence has its type. Every subject in language has its predicate. Every intension in logic has its extension. Each therefore has two levels but with the fundamental problem of the relationship between the two.
Heather, Michael, Rossiter, Nick
core  

Self-reducibility structures and solutions of NP problems

open access: yes, 1988
Using polynomial time self-reducibility structures, we characterize certain "helping" notions, show how the characterization provides the main tool for the proof of known relationships between decisional and functional NP-complete problems, and extend this relationships to the case of optimization NP-complete problems.
openaire   +1 more source

Discrete series of odd general spin groups

open access: yes, 2017
We obtain a classification of discrete series representations of odd general spin groups, generalizing the M{\oe}glin-Tadi\'c classification for classical groups.
Kim, Yeansu, Matić, Ivan
core  

On the Complexity of Polytope Isomorphism Problems

open access: yes, 2002
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time
Kaibel, Volker, Schwartz, Alexander
core   +3 more sources

Home - About - Disclaimer - Privacy