2430 search results - page 113 / 486 » Computing Tutte Polynomials |
136
click to vote
FOCS
1990
IEEE
15 years 9 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
146
click to vote
CG
2000
Springer
15 years 4 months ago
2000
Springer
Chaotic attractors generated by the iteration of polynomial functions with cyclic symmetry have been the subject of recent study. A new formulation is investigated which generates ...
179
click to vote
MICS
2007
15 years 4 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
138
click to vote
MFCS
2010
Springer
15 years 3 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
166
click to vote
CADE
2006
Springer
16 years 5 months ago
2006
Springer
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...