Search results for "m-reducible"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
104	Xiang Zhang 0001, Feng Pan 0001, Wei Wang 0010	REDUS: finding reducible subspaces in high dimensional data.	CIKM	2008	DBLP DOI BibTeX RDF	reducible subspace, high dimensional data
94	Ventzeslav Valev, Bülent Sankur, Petia Radeva	Generalized Non-Reducible Descriptors.	ICPR	2000	DBLP DOI BibTeX RDF	Supervised Pattern Recognition, Non-Reducible Descriptors, Generalized Non-Reducible Descriptors, Machine Learning, Descriptors
94	Paul Havlak	Nesting of Reducible and Irreducible Loops.	ACM Trans. Program. Lang. Syst.	1997	DBLP DOI BibTeX RDF	reducible loops, strongly-connected regions
82	Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa	Feedback Vertex Sets and Cyclically Reducible Graphs	J. ACM	1985	DBLP DOI BibTeX RDF
74	Sebastian Bab, Arfst Nickelsen	One Query Reducibilities Between Partial Information Classes.	MFCS	2004	DBLP DOI BibTeX RDF
61	Beverly Jamison, Stephan Olariu	A Linear-Time Recognition Algorithm for P4-Reducible Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF
61	Matthew S. Hecht, Jeffrey D. Ullman	Characterizations of Reducible Flow Graphs.	J. ACM	1974	DBLP DOI BibTeX RDF
51	Joachim von zur Gathen	Counting reducible and singular bivariate polynomials.	ISSAC	2007	DBLP DOI BibTeX RDF	bivariate polynomials, combinatorics on polynomials, reducible polynomials, singular polynomials, finite fields, counting problems
51	Oswaldo Vernet, Lilian Markenzon	Hamiltonian Problems for Reducible Flowgraphs.	SCCC	1997	DBLP DOI BibTeX RDF	Hamiltonian problems, reducible flowgraphs, unique Hamiltonian cycle, source vertex, Hamiltonian cycle, Hamiltonian path, flow graphs
50	Xujin Chen, Wenan Zang	An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.	Algorithmica	2006	DBLP DOI BibTeX RDF	Feedback set, Cycle packing, Algorithm, Complexity, Network flow
50	Larry Carter, Jeanne Ferrante, Clark D. Thomborson	Folklore confirmed: reducible flow graphs are exponentially larger.	POPL	2003	DBLP DOI BibTeX RDF	safety/security in digital systems, computational complexity, compilers, programming languages
50	Johan Janssen, Henk Corporaal	Making Graphs Reducible with Controlled Node Splitting.	ACM Trans. Program. Lang. Syst.	1997	DBLP DOI BibTeX RDF	compilation, instruction-level parallelism, reducibility, control flow graphs, node splitting, irreducibility
50	Martin Mundhenk	On Self-Reducible Sets of Low Information Content.	CIAC	1994	DBLP DOI BibTeX RDF
44	Ke Wang, Li-Yan Yuan	First-Order Logic Characterization of Program Properties.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	eductive databases, program properties, order reducible, FO-reducible programs, EDBs, database context, theorem-proving tools, stratified acyclic program, general chained program, bounded program, nonrecursive program, perfect models, extensional database, query processing, logic programming, logic programs, database theory, deductive databases, first-order logic, updates, integrity constraints, programming theory, fixed points, formal logic, inference rules, query answering, first-order theory
44	Stephen A. Fenner, Stuart A. Kurtz, James S. Royer	Every Polynomial-Time 1-Degree Collapses iff P=PSPACE	FOCS	1989	DBLP DOI BibTeX RDF	equivalent sets, m-reducible, Karp-reducible, polynomial-time computable function
43	Sebastian Unger, Frank Mueller 0001	Handling irreducible loops: optimized node splitting versus DJ-graphs.	ACM Trans. Program. Lang. Syst.	2002	DBLP DOI BibTeX RDF	irreducible flowgraphs, reducible flowgraphs, compilation, instruction-level parallelism, Code optimization, loops, control flow graphs, node splitting
42	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma	Upper Bounds and Algorithms for Parallel Knock-Out Numbers.	SIROCCO	2007	DBLP DOI BibTeX RDF	parallel knock-out schemes, computational complexity, claw-free graphs
42	Piotr Faliszewski, Mitsunori Ogihara	Separating the Notions of Self- and Autoreducibility.	MFCS	2005	DBLP DOI BibTeX RDF
42	Ulrich Hertrampf	Acceptance by Transformation Monoids (with an Application to Local Self Reductions).	CCC	1997	DBLP DOI BibTeX RDF	local self reduction, bottleneck machine, structural complexity
42	Emmanuel Kounalis	Testing for Inductive (Co)-Reducibility.	CAAP	1990	DBLP DOI BibTeX RDF	Proof by consistency, Ground terms in normal form, Term rewriting systems, Test Sets, Equations
40	Xujin Chen, Wenan Zang	An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs.	ISAAC	2004	DBLP DOI BibTeX RDF	feedback set, cycle packing, algorithm, complexity, network flow
40	Vadim V. Lozin	On a Generalization of Bi-Complement Reducible Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
40	Edward P. F. Chan, Héctor J. Hernández	Independence-reducible Database Schemes.	PODS	1988	DBLP DOI BibTeX RDF
38	M. Touzani Qriouet, C. Mira	Reducible fractional Harmonics Generated by the nonautonomous Duffing-Rayleigh equation: pockets of Reducible Harmonics and Arnold's Tongues.	Int. J. Bifurc. Chaos	2000	DBLP DOI BibTeX RDF
32	Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee	Identifying Loops Using DJ Graphs.	ACM Trans. Program. Lang. Syst.	1996	DBLP DOI BibTeX RDF	DJ graphs, Tarjan's interval, irreducible flowgraphs, reducible flowgraphs, dominator trees
32	Ming-Syan Chen, Philip S. Yu	Interleaving a Join Sequence with Semijoins in Distributed Query Processing.	IEEE Trans. Parallel Distributed Syst.	1992	DBLP DOI BibTeX RDF	beneficial semijoins, join sequence tree, reducible relations, relationaldatabases, query processing, distributed databases, database theory, interleaving, distributed query processing
32	Jun Hu 0002, Guoyin Wang 0001	Knowledge Reduction of Covering Approximation Space.	Trans. Comput. Sci.	2009	DBLP DOI BibTeX RDF	rough sets, reduction, Covering, granule
32	Waka Nagao, Yoshifumi Manabe, Tatsuaki Okamoto	Relationship of Three Cryptographic Channels in the UC Framework.	ProvSec	2008	DBLP DOI BibTeX RDF	Secure Channel (SC), Two-Anonymous Channel (2AC), Direction-Indeterminable Channel (DIC), Universal Composability (UC), Probabilistic Input/Output Automaton (PIOA)
32	Lance Fortnow, Mitsunori Ogihara	Very Sparse Leaf Languages.	MFCS	2006	DBLP DOI BibTeX RDF
32	Harry Buhrman, Leen Torenvliet, Falk Unger	Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds.	STACS	2006	DBLP DOI BibTeX RDF	Selfreducibility, Computational Complexity, Sparseness
32	André Hernich, Arfst Nickelsen	Combining Self-reducibility and Partial Information Algorithms.	MFCS	2005	DBLP DOI BibTeX RDF
32	Somchai Chatvichienchai, Mizuho Iwaihara, Yahiko Kambayashi	Authorization Translation for XML Document Transformation.	World Wide Web	2004	DBLP DOI BibTeX RDF	XML access control models, authorizations, database security, XML documents, document transformation
32	Ueli M. Maurer, Renato Renner, Clemens Holenstein	Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology.	TCC	2004	DBLP DOI BibTeX RDF
32	Johan Janssen, Henk Corporaal	Controlled Node Splitting.	CC	1996	DBLP DOI BibTeX RDF	compilation, instruction level parallelism, reducibility, control flow graphs, node splitting, irreducibility
32	Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik	On Coherence, Random-self-reducibility, and Self-correction.	CCC	1996	DBLP DOI BibTeX RDF	self-correctability, random-self-reducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity
32	Rainer Schuler	Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions.	FSTTCS	1995	DBLP DOI BibTeX RDF
32	Vikraman Arvind, Johannes Köbler, Martin Mundhenk	Hausdorff Reductions to Sparse Sets and to Sets of High Information Content.	MFCS	1993	DBLP DOI BibTeX RDF
32	Tatsuaki Okamoto, Kazuo Ohta	Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility.	EUROCRYPT	1989	DBLP DOI BibTeX RDF
32	Matthew S. Hecht, Jeffrey D. Ullman	Analysis of a Simple Algorithm for Global Flow Problems.	POPL	1973	DBLP DOI BibTeX RDF	available expressions, depth-first spanning tree, global data flow analysis, live variables, reducibility, dominance, code optimization, interval analysis, flow graph
29	Guang Zeng, Yang Yang, Wenbao Han, Shuqin Fan	Reducible Polynomial over F2 Constructed by Trinomial sigma-LFSR.	Inscrypt	2008	DBLP DOI BibTeX RDF	Stickelberger-Swan Theorem, ??LFSR, Finite Field, Linear Feedback Shift Register(LFSR), Irreducible Polynomial
29	Cem Güneri, Ferruh Özbudak	Cyclic Codes and Reducible Additive Equations.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
29	Remco Duits, Michael Felsberg, Gösta H. Granlund, Bart M. ter Haar Romeny	Image Analysis and Reconstruction using a Wavelet Transform Constructed from a Reducible Representation of the Euclidean Motion Group.	Int. J. Comput. Vis.	2007	DBLP DOI BibTeX RDF
29	Igor E. Zverovich	A Characterization of Domination Reducible Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Domination number, Hereditary class of graphs, Forbidden induced subgraph, Homogeneous set
29	G. Ramalingam, Thomas W. Reps	An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph.	POPL	1994	DBLP DOI BibTeX RDF
29	Thomas Thierauf, Seinosuke Toda, Osamu Watanabe 0001	On Sets Bounded Truth-Table Reducible to P-selective Sets.	STACS	1994	DBLP DOI BibTeX RDF
29	Thomas Ball	What's In a Region? Or Computing Control Dependence Regions In Near-Linear Time for Reducible Control Flow.	LOPLAS	1993	DBLP DOI BibTeX RDF	regions, control-flow graph, control dependence
22	Enrique Miranda 0001, Inés Couso, Pedro Gil	Upper Probabilities Attainable by Distributions of Measurable Selections.	ECSQARU	2009	DBLP DOI BibTeX RDF	Dempster-Shafer upper and lower probabilities, measurable selections, reducible ?-fields, Aumann integral, Choquet integral, Random sets
22	Katerina Asdre, Stavros D. Nikolopoulos	The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs.	FAW	2008	DBLP DOI BibTeX RDF	fixed-endpoint path cover, complement reducible graphs, linear-time algorithms, perfect graphs, cographs, path cover
22	Emmanuel Bresson, Jean Monnerat, Damien Vergnaud	Separation Results on the "One-More" Computational Problems.	CT-RSA	2008	DBLP DOI BibTeX RDF	“One-more” problems, Random self-reducible problems, Algebraic algorithms, Black-box reductions
22	Haruko Okamura	Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	k-edge-connected, disjoint 2 paths, 2-reducible
22	Vugranam C. Sreedhar, Guang R. Gao, Yong-Fong Lee	A New Framework for Elimination-Based Data Flow Analysis Using DJ Graphs.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	DJ graphs, Tarjan's interval, exhaustive and incremental data flow analysis, irreducible flowgraphs, reducible flowgraphs
22	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung	On Monotone Formula Closure of SZK	FOCS	1994	DBLP DOI BibTeX RDF	honest-verifier interactive SZK proof systems, monotone formula closure, SZK, statistical zero knowledge, monotone logical formula, protocol techniques, random self reducible languages, Boolean operations, structural properties, closure properties
22	Andrzej Hlawiczka	Parallel Signature Analyzers Using Hybrid Design of Their Linear Feedbacks.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	parallel signature analyzers, linear feedbacks, bottom-top exclusive OR, multiple input linear feedback shift register, top-bottom exclusive OR, reducible characteristic polynomial, error sequence aliasing, logic analysers, signal processing equipment, shift registers, XOR gates
22	Richard Beigel, Mihir Bellare, Joan Feigenbaum, Shafi Goldwasser	Languages that Are Easier than their Proofs	FOCS	1991	DBLP DOI BibTeX RDF	nonrandom self-reducible sets, triple-exponential time, incoherent sets, formal languages, membership, NP, DSPACE
22	Seinosuke Toda	The Complexity of Finding Medians	FOCS	1990	DBLP DOI BibTeX RDF	1-Turing reducible, finding medians, PF(Hash P), metric Turing machines, complexity, MidP
21	Vikraman Arvind, Srikanth Srinivasan 0001	On the hardness of the noncommutative determinant.	STOC	2010	DBLP DOI BibTeX RDF	noncommutative rings, determinant, arithmetic circuits, permanent
21	Aduri Pavan, N. V. Vinodchandran	2-Local Random Reductions to 3-Valued Functions.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	68Q17, Subject classification. 68Q15
21	John M. Hitchcock, María López-Valdés, Elvira Mayordomo	Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Effective dimension, Scaled dimension, Turing-hard sets, Kolmogorov complexity
21	Paul Brodhead, Douglas A. Cenzer	Effectively closed sets and enumerations.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03D30, 03D25
21	Andreas Podelski	Verification, Least-Fixpoint Checking, Abstraction.	VSTTE	2008	DBLP DOI BibTeX RDF
21	Martin Röder, Jean Cardinal, Raouf Hamzaoui	Efficient Rate-Distortion Optimized Media Streaming for Tree-Structured Packet Dependencies.	IEEE Trans. Multim.	2007	DBLP DOI BibTeX RDF
21	Leilei Qi, Huaxia Zhang	Reason out Emergence from Cellular Automata Modeling.	Model-Based Reasoning in Science, Technology, and Medicine	2007	DBLP DOI BibTeX RDF
21	Bernhard Scholz, Johann Blieberger	A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees.	CC	2007	DBLP DOI BibTeX RDF
21	Jacobo Torán	Reductions to Graph Isomorphism.	FSTTCS	2007	DBLP DOI BibTeX RDF	Computational complexity, reducibilities, graph isomorphism
21	Anna Bernasconi 0001, Valentina Ciriani	DRedSOP: Synthesis of a New Class of Regular Functions.	DSD	2006	DBLP DOI BibTeX RDF
21	David Doty	Every Sequence Is Decompressible from a Random One.	CiE	2006	DBLP DOI BibTeX RDF	compression, Kolmogorov complexity, martingale, Turing reduction, random sequence, Constructive dimension
21	Robert Rettinger, Xizhong Zheng	Solovay Reducibility on D-c.e Real Numbers.	COCOON	2005	DBLP DOI BibTeX RDF
21	Yash P. Aneja, R. Chandrasekaran, K. P. K. Nair	Minimal-cost system reliability with discrete-choice sets for components.	IEEE Trans. Reliab.	2004	DBLP DOI BibTeX RDF
21	Moreno Andreatta, D. T. Vuza, Carlos Agón	On some theoretical and computational aspects of Anatol Vieru's periodic sequences.	Soft Comput.	2004	DBLP DOI BibTeX RDF	Algebraic formalization, Finite difference calculus on groups, Decomposition, Periodic sequences
21	Dima Grigoriev, Fritz Schwarz	Factoring and Solving Linear Partial Differential Equations.	Computing	2004	DBLP DOI BibTeX RDF	Partial differential equations, factorization
21	Eric Allender, Harry Buhrman, Michal Koucký 0001	What Can be Efficiently Reduced to the K-Random Strings?	STACS	2004	DBLP DOI BibTeX RDF
21	Xizhong Zheng, Robert Rettinger	On the Extensions of Solovay-Reducibility..	COCOON	2004	DBLP DOI BibTeX RDF
21	Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe 0001	The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
21	Luca Trevisan, Salil P. Vadhan	Pseudorandomness and Average-Case Complexity via Uniform Reductions.	CCC	2002	DBLP DOI BibTeX RDF
21	Kouichi Hirata, Hiroshi Sakamoto	Prediction-Preserving Reducibility with Membership Queries on Formal Languages.	FCT	2001	DBLP DOI BibTeX RDF	prediction-preserving reduction with membership queries, prediction with membership queries, pattern languages, learning theory, context-free grammars, grammatical inference
21	Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe 0001	On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems.	STACS	2001	DBLP DOI BibTeX RDF
21	Wolfgang Merkle	The Global Power of Additional Queries to p-Random Oracles.	ICALP	2000	DBLP DOI BibTeX RDF
21	Klaus Ambos-Spies	Measure Theoretic Completeness Notions for the Exponential Time Classes.	MFCS	2000	DBLP DOI BibTeX RDF
21	Vikraman Arvind, Jacobo Torán	Sparse Sets, Approximable Sets, and Parallel Queries to NP.	STACS	1999	DBLP DOI BibTeX RDF
21	László Babai, Sophie Laplante	Stronger Separations for Random-Self-Reducibility, Rounds, and Advice.	CCC	1999	DBLP DOI BibTeX RDF
21	Loon-Been Chen, I-Chen Wu	On the Complexity of the Minimum and Maximum Global Snapshot Problems.	COMPSAC	1997	DBLP DOI BibTeX RDF
21	Christoph Meinel, Anna Slobodová	A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams.	STACS	1997	DBLP DOI BibTeX RDF
21	Harry Buhrman, Lance Fortnow, Leen Torenvliet	Six Hypotheses in Search of a Theorem.	CCC	1997	DBLP DOI BibTeX RDF
21	Harry Buhrman, Luc Longpré	Compressibility and Resource Bounded Measure.	STACS	1996	DBLP DOI BibTeX RDF
21	Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo	Weakly Useful Sequences.	ICALP	1995	DBLP DOI BibTeX RDF
21	Vikraman Arvind, Johannes Köbler, Rainer Schuler	On Helping and Interactive Proof Systems.	ISAAC	1994	DBLP DOI BibTeX RDF
21	Ronald V. Book, Jack H. Lutz, David M. Martin Jr.	The Global Power of Additional Queries to Random Oracles.	STACS	1994	DBLP DOI BibTeX RDF
21	Ayumi Shinohara	Complexity of Computing Generalized VC-Dimensions.	ECML	1994	DBLP DOI BibTeX RDF
21	Vikraman Arvind, Johannes Köbler, Martin Mundhenk	On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets.	FSTTCS	1992	DBLP DOI BibTeX RDF
21	Philip K. Hooper	Monogenic Post Normal Systems of Arbitrary Degree.	J. ACM	1966	DBLP DOI BibTeX RDF
19	Rishiraj Bhattacharyya, Sourav Chakraborty 0001, Yash Pote, Uddalok Sarkar, Sayantan Sen	Testing Self-Reducible Samplers.	AAAI	2024	DBLP DOI BibTeX RDF
19	Imran Allie	Reducible 3-critical graphs.	RAIRO Oper. Res.	2023	DBLP DOI BibTeX RDF
19	Bahar Aameri, Michael Grüninger	Reducible Theories and Amalgamations of Models.	ACM Trans. Comput. Log.	2023	DBLP DOI BibTeX RDF
19	Xiaoqiang Wang 0001, Yue Su, Dabin Zheng, Wei Lu	Two classes of reducible cyclic codes with large minimum symbol-pair distances.	CoRR	2023	DBLP DOI BibTeX RDF
19	Pengyu Chen, Dongjing Miao, Weitian Tong, Zizheng Guo, Jianzhong Li 0001, Zhipeng Cai 0001	Random-Order Enumeration for Self-Reducible NP-Problems.	CoRR	2023	DBLP DOI BibTeX RDF
19	Matthew Farrugia-Roberts	Functional Equivalence and Path Connectivity of Reducible Hyperbolic Tangent Networks.	CoRR	2023	DBLP DOI BibTeX RDF
19	Gabriella Holden, Daniel Shiu, Lauren Strutt	Identifying reducible k-tuples of vectors with subspace-proximity sensitive hashing/filtering.	CoRR	2023	DBLP DOI BibTeX RDF
19	Davide Basile 0001	A Sound and Complete Refinement Relation for Non-reducible Modal Transition Systems.	CoRR	2023	DBLP DOI BibTeX RDF
19	Rishiraj Bhattacharyya, Sourav Chakraborty 0001, Yash Pote, Uddalok Sarkar, Sayantan Sen	Testing Self-Reducible Samplers.	CoRR	2023	DBLP DOI BibTeX RDF
19	Anna Mpanti, Stavros D. Nikolopoulos, Leonidas Palios	Strong watermark numbers encoded as reducible permutation graphs against edge modification attacks.	J. Comput. Secur.	2023	DBLP DOI BibTeX RDF